Home > Backend Development > PHP Tutorial > Summary of methods to implement Joseph's problem in PHP, summary of PHP implementation of Joseph's problem_PHP tutorial

Summary of methods to implement Joseph's problem in PHP, summary of PHP implementation of Joseph's problem_PHP tutorial

WBOY
Release: 2016-07-13 10:01:05
Original
1060 people have browsed it

A summary of how to implement Joseph's problem in PHP, a summary of how to implement Joseph's problem in PHP

The example in this article summarizes the method of implementing Joseph's problem in PHP. Share it with everyone for your reference. The specific analysis is as follows:

A group of monkeys line up in a circle and are numbered 1, 2,...,n. Then start counting from the 1st one, count to the mth one, kick it out of the circle, start counting from behind it, count to the mth one, kick it out..., and continue in this way. Until there is only one monkey left, that monkey is called the king. Programming is required to simulate this process, input m, n, and output the number of the last king.

Analysis:

The Joseph Ring is a mathematical application problem: it is known that n people (represented by numbers 1, 2, 3...n respectively) are sitting around a round table. Start counting from the person numbered k, and the person who counts to m comes out of the queue; the next person starts counting from 1, and the person who counts to m comes out of the queue again; repeat this pattern until around the round table All the people came out.

Method 1:

<&#63;php
function getLeader($n,$m) { 
  $res=0; 
  for($i=2; $i<=$n; $i++) {
    $res=($res+$m)%$i; 
  }
  return $res+1; 
} 
$leader = getLeader(13,34);
echo $leader;
&#63;>
Copy after login

Method 2:

<&#63;php
//定义函数
function getKing($monkeys , $m , $current = 0){
  $number = count($monkeys);
  $num = 1;
  if(count($monkeys) == 1){
    echo '<font color="red">编号为'.$monkeys[0].'的猴子成为猴王了!</font>';
    return;
  }else{
    while($num++ < $m){
      $current++ ;
      $current = $current%$number;
    }
    echo "编号为".$monkeys[$current]."的猴子被踢掉了...<br/>";
    array_splice($monkeys , $current , 1);
    getKing($monkeys , $m , $current);
  }
}
$n=13;   //总共猴子数目
$m = 34;  //数到第几只的那只猴子被踢出去
$monkeys = range(1,$n); //将猴子编号放入数组中
getKing($monkeys , $m);   //调用函数
&#63;>
Copy after login

I hope this article will be helpful to everyone’s PHP programming design.

www.bkjia.comtruehttp: //www.bkjia.com/PHPjc/972649.htmlTechArticleA summary of how to implement Joseph's problem in PHP, a summary of how to implement Joseph's problem in PHP This article summarizes the method of implementing Joseph's problem in PHP. Share it with everyone for your reference. The specific analysis is as follows: 1...
Related labels:
source:php.cn
Statement of this Website
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn
Popular Tutorials
More>
Latest Downloads
More>
Web Effects
Website Source Code
Website Materials
Front End Template