技术 -> 排序组合

 

 

<?PHP
header("Content-type: text/html; charset=utf-8");
?>


<?PHP
$d = array(); 

$d[0][0] = array('start'=>0,'end'=>3);
$d[0][1] = array('start'=>0,'end'=>2);

$d[1][0] = array('start'=>4,'end'=>6);
$d[1][1] = array('start'=>4,'end'=>5);
$d[1][2] = array('start'=>4,'end'=>7);
 

$d[2][0] = array('start'=>6,'end'=>8);
$d[2][1] = array('start'=>6,'end'=>9); 





$ff = array();
ii($ff,$d,0);
function ii($ff,$d,$f){
	
	foreach($d[$f]  as $k=>$v){
 
		$ff[$f]='$d['.$f.']['.$k.'],';

		if($f < (count($d)-1)){

			ii($ff,$d,$f+1);
			
		}else{
			//ii($d,);;
			print_r($ff);
			echo '<HR>';
		}
	}
}
/* 结果 
Array ( [0] => $d[0][0], [1] => $d[1][0], [2] => $d[2][0], ) 
Array ( [0] => $d[0][0], [1] => $d[1][0], [2] => $d[2][1], ) 
Array ( [0] => $d[0][0], [1] => $d[1][1], [2] => $d[2][0], ) 
Array ( [0] => $d[0][0], [1] => $d[1][1], [2] => $d[2][1], ) 
Array ( [0] => $d[0][0], [1] => $d[1][2], [2] => $d[2][0], ) 
Array ( [0] => $d[0][0], [1] => $d[1][2], [2] => $d[2][1], ) 
Array ( [0] => $d[0][1], [1] => $d[1][0], [2] => $d[2][0], ) 
Array ( [0] => $d[0][1], [1] => $d[1][0], [2] => $d[2][1], ) 
Array ( [0] => $d[0][1], [1] => $d[1][1], [2] => $d[2][0], ) 
Array ( [0] => $d[0][1], [1] => $d[1][1], [2] => $d[2][1], ) 
Array ( [0] => $d[0][1], [1] => $d[1][2], [2] => $d[2][0], ) 
Array ( [0] => $d[0][1], [1] => $d[1][2], [2] => $d[2][1], ) 

*/ 
?>