当前位置: 代码迷 >> 综合 >> phpnbsp;猴王算法
  详细解决方案

phpnbsp;猴王算法

热度:83   发布时间:2024-01-18 12:10:44.0

猴王算法


<?php

function getKingMokey($n, $m)
{
        $monkey[0] = 0;

        //将1-n只猴子顺序编号 入数组中
        for($i= 1; $i<= $n; $i++) 
       
               $monkey[$i] = $i;
        }

        $len = count($monkey);

        //循环遍历数组元素(猴子编号)
        for($i= 0; $i< $len; $i= $i)
        {
              $num = 0;

            
             foreach($monkey as $key => $value) 
            
                if($value == 0) continue; 
                $num++; 
                $values = $value; 
             }

             //若只剩一只猴子 则输出该猴子编号(数组元素值) 并退出循环 
             if($num == 1) 
            
                    echo $values;
                    exit; 
             }

            

             //将第$i只猴子踢出队伍(相应数组位置元素值设为0) 
             $monkey[$i] = 0;

             //打印该猴子位置 
             echo $i."";

           

             //设置计数器 
             for($j= 1; $j<= $m; $j++) 
            
                   //猴子编号加一,遍历下一只猴子 
                   $i++;

                   //若该猴子未被踢出队伍,获取下一只猴子编号 
                   if($monkey[$i] > 0) continue;

                   //若元素值为0,则猴子已被踢出队伍,进而循环取下一只猴子编

号 
                   if($monkey[$i] == 0) 
                  
                           //取下一只猴子编号 
                           for($k= $i; $k< $len; $k++)
                          
                                   //值为0,编号加1 
                                   if($monkey[$k] == 0) $i++;

                                   //否则,编号已取得,退出 
                                   if($monkey[$k] > 0) break;
                          
                    }

                   //若编号大于猴子个数,则从第0只猴子开始遍历(数组指针归零)

步骤同上 
                   if($i == $len) $i = 0;

                   //同上步骤,获取下一只猴子编号
                   if($monkey[$i] == 0) 
                  
                          for($k= $i; $k< $len; $k++) 
                          {
                                   if($monkey[$k] == 0) $i++;

                                  if($monkey[$k] > 0) break;
                         
                  
            }
      }
}

//猴子个数 
$n = 10;

//踢出队伍的编号间隔值 
$m = 3;

//调用猴王获取函数

getKingMokey($n, $m);

?>

用递归的算法
$monkeys = array(1 , 2 , 3 , 4 , 5 , 6 , 7, 8 , 9 , 10);  //monkey的编号
$m = 4;  //数到第几只的那只猴子被踢出去


function killMonkey($monkeys , $m , $current = 0){
    $number = count($monkeys);
        $num = 1;
        if(count($monkeys) == 1){
            echo $monkeys[0]."成为猴王了";
            return;
        }
        else{
            while($num++ < $m){
                    $current++ ;
                    $current = $current%$number;
                }
                echo $monkeys[$current]."的猴子被踢掉了<br/>";
                array_splice($monkeys , $current , 1);
                killMonkey($monkeys , $m , $current);
        }
}
killMonkey($monkeys , $m);