PHP 斗牛算法

/**
* 斗牛计算算法
* @param array $cards=array(1,2,7,8,0);
* @return int 0没有牛,10牛牛
*/
function niu($cards=array())
{
//所有有牛的组合
$nius = array(array(1,1,8),array(1,2,7),array(1,3,6),array(1,4,5),array(2,3,5),array(2,2,6),array(2,4,4),array(3,3,4),array(10,9,1),array(10,8,2),array(10,7,3),array(10,6,4),array(10,5,5),array(9,8,3),array(9,7,4),array(9,6,5),array(8,7,5),array(8,8,4),array(8,6,6),array(7,7,6),array(10,10,10));
$flag = false;//默认没有牛
$bakcards = $cards;
foreach($nius as $key=>$niu)
{
$fnum = 0;
foreach($niu as $k=>$v)
{
if(in_array($v, $cards)){
$fnum++;
array_splice($cards,array_search($v,$cards),1);
}
}
if($fnum>2)
{
$flag = true;
break;
}else
{
$cards = $bakcards;
}

}
if( $flag ){
$niunum = intval($cards[0]+$cards[1])%10;
return $niunum===0?10:$niunum;
}else{
return 0;
}
}