Home  >  Article  >  Backend Development  >  PHP implements a method to find the full arrangement of an array and all combinations of elements

PHP implements a method to find the full arrangement of an array and all combinations of elements

墨辰丷
墨辰丷Original
2018-05-24 17:09:562761browse

The following editor will bring you a summary of the method of searching for the full arrangement of an array and all combinations of elements in PHP. The editor thinks it’s pretty good, so I’ll share it with you now and give it as a reference. Let’s follow the editor and take a look.

The example in this article describes the method of finding the full arrangement of an array and a summary of all combinations of elements in PHP.

Share it with everyone for your reference, the details are as follows:

##

"; //输出第一种组合
while (true) {
 $y = $x--; //相邻的两个元素
 if ($source[$x] < $source[$y]) { //如果前一个元素的值小于后一个元素的值
  $z = $last;
  while ($source[$x] > $source[$z]) { //从尾部开始,找到第一个大于 $x 元素的值
   $z--;
  }
  /* 交换 $x 和 $z 元素的值 */
  list($source[$x], $source[$z]) = array($source[$z], $source[$x]);
  /* 将 $y 之后的元素全部逆向排列 */
  for ($i = $last; $i > $y; $i--, $y++) {
   list($source[$i], $source[$y]) = array($source[$y], $source[$i]);
  }
  echo implode(',', $source), "
"; //输出组合 $x = $last; $count++; } if ($x == 0) { //全部组合完毕 break; } } echo 'Total: ', $count, "\n"; ?>

The above is the entire content of this article, I hope it will be helpful to everyone's study.


Related recommendations:

php Method to get a random combination from a specified number

Visitor pattern and combination in object-oriented PHPDetailed explanation of pattern

js merge numbercombination Detailed explanation of the steps to generate key: value

The above is the detailed content of PHP implements a method to find the full arrangement of an array and all combinations of elements. For more information, please follow other related articles on the PHP Chinese website!

Statement:
The content of this article is voluntarily contributed by netizens, and the copyright belongs to the original author. This site does not assume corresponding legal responsibility. If you find any content suspected of plagiarism or infringement, please contact admin@php.cn