PHP：如何获得与子数组的最匹配的组合？

Question

我有一个$myArray，子数组总是包含5个数字-数字按大小排序，不能在子数组中重复，但是$myArray中可以有更多“相同”的子数组（具有相同数字的子数组）。

$myArray = array(
array(1,2,3,4,5),
array(5,6,10,18,20),
array(1,2,3,4,5),
array(2,3,4,5,9),
array(1,2,3,7,9),
array(1,3,4,5,7),
array(2,3,4,7,9),
array(2,4,5,10,29),
array(1,8,10,11,15) // etc.
);

如何获得$n数字的组合（数组），其中该组合（或者更确切地说，由该$n数字组合生成的5个数字组合）将与$myArray的大多数子数组相匹配？

示例：$myArray的$n=7的所需结果将是数组（1,2,3,4,5,7,9），因为从该结果导出的总共有二十一个5个数字组合：

1,2,3,4,5
1,2,3,4,7
1,2,3,4,9
//... and so on

这些组合将匹配几乎所有的子数组（只有第二个和最后两个子数组超出范围）。

我曾尝试使用数组\u count\u values（）进行计数，但在这种情况下，所有数字的简单频率不起作用。。。

Answer 1

                        class Combinations implements Iterator
                        {
                            protected $c = null;
                            protected $s = null;
                            protected $n = 0;
                            protected $k = 0;
                            protected $pos = 0;

                            function __construct($s, $k) {
                                if(is_array($s)) {
                                    $this->s = array_values($s);
                                    $this->n = count($this->s);
                                } else {
                                    $this->s = (string) $s;
                                    $this->n = strlen($this->s);
                                }
                                $this->k = $k;
                                $this->rewind();
                            }
                            function key() {
                                return $this->pos;
                            }
                            function current() {
                                $r = array();
                                for($i = 0; $i < $this->k; $i++)
                                    $r[] = $this->s[$this->c[$i]];
                                return is_array($this->s) ? $r : implode('', $r);
                            }
                            function next() {
                                if($this->_next())
                                    $this->pos++;
                                else
                                    $this->pos = -1;
                            }
                            function rewind() {
                                $this->c = range(0, $this->k);
                                $this->pos = 0;
                            }
                            function valid() {
                                return $this->pos >= 0;
                            }
                            //
                            protected function _next() {
                                $i = $this->k - 1;
                                while ($i >= 0 && $this->c[$i] == $this->n - $this->k + $i)
                                    $i--;
                                if($i < 0)
                                    return false;
                                $this->c[$i]++;
                                while($i++ < $this->k - 1)
                                    $this->c[$i] = $this->c[$i - 1] + 1;
                                return true;
                            }
                        }







            $tickets = array(
                 array(1,2,3,4,5),
                 array(5,6,10,18,20),
                 array(1,2,3,4,5),
                 array(2,3,4,5,9),
                 array(1,2,3,7,9),
                 array(1,3,4,5,7),
                 array(2,3,4,7,9),
                 array(2,4,5,10,29),
                 array(1,8,10,11,15) // etc.
            );
    // first we need to find all numbers  that are actually in one of the arrays.

            foreach($tickets as $anArray) {
                foreach($anArray as $aNumberUsed){
                    $numbersUsed[$aNumberUsed] = $aNumberUsed;
                } 
            }
  // next we assign the number of integers in the set we are looking for.       
            $r = 7;
// next we run the above class on our array (which gets us all of the possible combinations of these numbers).
            foreach(new Combinations($numbersUsed, 7) as $comboKey => $substring){
                $comboList[$comboKey] = $substring;
                $countWins = 0;
// here we loop through all of the 5 number arrays, and flag any array who has all the variables in this iteration of the possible numbers.  There are cleaner ways to do this, but this is easy to understand.
                foreach($tickets as $valueList) {
                    $countNumbersFound = 0;
                    foreach($valueList as $value) {
                        if(in_array($value, $substring)) {
                            $countNumbersFound++;
                        }
                    }
                    if($countNumbersFound == 5) {
                        $countWins++;
                    }       
                }
                $foundCount[$comboKey] = $countWins;
            }
    $bigly = max($foundCount);


    $key = array_search($bigly, $foundCount);

    foreach($comboList[$key] as $wellDone) {
        echo "$wellDone ,";
    }   

这门课是从这里偷来的：http://www.developerfiles.com/combinations-in-php/

下课后的一切都是原创的。我不相信重新发明轮子。