조셉 링 문제(원형 연결 리스트)

php算法

header("content-type:text/html;charset=utf-8");
class Child{
public $no;
public $next=null;

public function __construct($no){
$this->no=$no;
     }
}
function addChild($n,&$first){        //$n是小孩个数，创建环形链表
	for($i=0;$i<$n;$i  ){
		$child=new Child($i 1);
		if($i==0){
		$first=$child;
		$cur=$child;
		$cur->next=$cur;
		}else{
		$cur->next=$child;
		$child->next=$first;
		$cur=$cur->next;
                  }
      }
}
function showHero($first){
$cur=$first;
while($cur->next!=$first){
echo "小孩编号：".$cur->no;
$cur=$cur->next;
         }
		 echo "小孩编号：".$cur->no;
}

function countChild($first,$m,$k){
	$cur=$first;
	for($i=0;$i<$m-1;$i  ){
	$cur=$cur->next;
	}
	$j=0;
	while($cur!=$cur->next){
		if($j==$k-2){
			echo "出列编号：".$cur->next->no;
			$cur->next=$cur->next->next;
			$cur=$cur->next;
			$j=0;


		}else{
			$cur=$cur->next;
			$j  ;
                           }
       }
	   	echo "最后出列编号：".$cur->no;
}
addChild(10,$first);
showHero($first);
echo "";
countChild($first,2,3); //第二个小孩开始数，数到三出列

?>