我有一个具有这种结构的数组:
Array (
[0] => Array ( [key] => Egg Method [values] => Array (
[0] => Array ( [id] => 1 [value] => Boiled )
[1] => Array ( [id] => 2 [value] => Poached )
[2] => Array ( [id] => 3 [value] => Fried )
[3] => Array ( [id] => 4 [value] => Scrambled ) ) )
[1] => Array ( [key] => Bread [values] => Array (
[0] => Array ( [id] => 5 [value] => White )
[1] => Array ( [id] => 6 [value] => Brown ) ) )
[2] => Array ( [key] => Egg Hardness [values] => Array (
[0] => Array ( [id] => 7 [value] => Soft )
[1] => Array ( [id] => 7 [value] => Medium )
[2] => Array ( [id] => 8 [value] => Hard ) ) )
)
如何迭代数组以输出所有可能的排列,即
Egg Method: Boiled / Bread: White / Egg Hardness: Soft
Egg Method: Boiled / Bread: White / Egg Hardness: Medium
Egg Method: Boiled / Bread: White / Egg Hardness: Hard
Egg Method: Boiled / Bread: Brown / Egg Hardness: Soft
Egg Method: Boiled / Bread: Brown / Egg Hardness: Medium
Egg Method: Boiled / Bread: Brown / Egg Hardness: Hard
Egg Method: Poached / Bread: White / Egg Hardness: Soft
Egg Method: Poached / Bread: White / Egg Hardness: Medium
Egg Method: Poached / Bread: White / Egg Hardness: Hard
Egg Method: Poached / Bread: Brown / Egg Hardness: Soft
Egg Method: Poached / Bread: Brown / Egg Hardness: Medium
Egg Method: Poached / Bread: Brown / Egg Hardness: Hard
etc etc
另外一个问题是我不知道可能有多少个数组标准,所以不幸的是我不能只使用3个嵌套循环。
我正在使用PHP,虽然我猜伪代码解决方案会很好,我可以适应它。
答案 0 :(得分:0)
使用嵌套for循环可以解决您的问题:
for($i=0;$i<Array.length;$i++){
for($j=0;$j<Array[$i].length;$j++){
//Echo'ing resultant array element.
echo $Array[$i][$j];
}
}
答案 1 :(得分:0)
解决了它
recurse("", $partoptions, 0);
function recurse($longstring, $partoptions, $index) {
$key = $partoptions[$index]['key'];
$values = $partoptions[$index]['values'];
for ($i=0; $i<sizeof($values); $i++) {
$thisvalue = $values[$i]['value'];
if (sizeof($partoptions)>$index+1) {
$tmplongstring = $longstring . ($longstring==""?"":" / ") . $thisvalue;
recurse($tmplongstring, $partoptions, $index+1);
} else {
echo $longstring . " / " . $thisvalue . "<br>";
}
}
}