pai_lie_zu_he

二维数组的排列组合算法

【回首页  2007-02-03】 

算法问题一直比较难，二维数组的组合运算算是比较经典的了。  

function sysCombineArray($CombinList)

{

    if(!is_array(current($CombinList)))

    {

        echo "参数不是2维数组";

        return false;

    }

    /* 计算C(a,1) * C(b, 1) * ... * C(n, 1)的值 */

    $CombineCount = 1;

    foreach($CombinList as $Key => $Value)

    {

        $CombineCount *= count($Value);

    }

    $RepeatTime = $CombineCount;

    foreach($CombinList as $ClassNo => $ParamList)

    {

        // $ParamList中的元素在拆分成组合后纵向出现的最大重复次数

        $RepeatTime = $RepeatTime / count($ParamList);

        $StartPosition = 1;

        foreach($ParamList as $Param)

        {

            $TempStartPosition = $StartPosition;

            $SpaceCount = $CombineCount / count($ParamList) / $RepeatTime;

            for($J = 1; $J <= $SpaceCount; $J ++)

            {

                for($I = 0; $I < $RepeatTime; $I ++)

                {

                   $Result[$TempStartPosition + $I][$ClassNo] = $Param;

                }

                $TempStartPosition += $RepeatTime * count($ParamList);

            }

            $StartPosition += $RepeatTime;

        }

    }

    return $Result;

}