【发布时间】:2017-11-06 18:16:22
【问题描述】:
你好,我是 php 新手,我刚刚陷入头脑风暴数组,我有下面的 php 数组
[0] => Array
(
[0] => Array
(
[1] => 5
[2] => 12
[11] => 15
)
[1] => Array
(
[1] => 5
[2] => 12
[11] => 16
)
[2] => Array
(
[1] => 4
[2] => 9
[11] => 15
)
[3] => Array
(
[1] => 3
[2] => 9
[11] => 15
)
[4] => Array
(
[1] => 3
[2] => 9
[11] => 16
)
[5] => Array
(
[1] => 3
[2] => 13
[11] => 15
)
[6] => Array
(
[1] => 3
[2] => 13
[11] => 16
)
[7] => Array
(
[1] => 3
[2] => 12
[11] => 15
)
[8] => Array
(
[1] => 3
[2] => 12
[11] => 16
)
[9] => Array
(
[1] => 4
[2] => 9
[11] => 16
)
[10] => Array
(
[1] => 4
[2] => 13
[11] => 15
)
[11] => Array
(
[1] => 4
[2] => 13
[11] => 16
)
[12] => Array
(
[1] => 4
[2] => 12
[11] => 15
)
[13] => Array
(
[1] => 4
[2] => 12
[11] => 16
)
[14] => Array
(
[1] => 5
[2] => 9
[11] => 15
)
[15] => Array
(
[1] => 5
[2] => 13
[11] => 16
)
)
我想在下面输出
[0]=> Array
(
[5]=> Array
(
[12]=> Array
(
[0] => 15
[1] => 16
)
[9]=> Array
(
[0] => 15
)
[13]=> Array
(
[0] => 16
)
)
[4]=> Array
(
[9]=> Array
(
[0] => 15
[1] => 16
)
[13]=> Array
(
[0] => 16
)
[12]=> Array
(
[0] => 15
[1] => 16
)
)
[3]=> Array
(
[9]=> Array
(
[0] => 15
[1] => 16
)
[13]=> Array
(
[0] => 15
[1] => 16
)
[12]=> Array
(
[0] => 15
[1] => 16
)
)
)
抱歉,说的不是很清楚,但我想先检查每个数组的公共值,例如 5,4 和 3,然后根据这些值遍历每个值并创建树数组 作为简单的示例,我希望每个数组的第一个元素,然后递归数组检查值并创建新的 示例只有 3 级,但我想要递归的 n 级,帮助将不胜感激。
【问题讨论】:
-
你的问题至少太宽泛了没有尝试......
-
你有更小的例子和输出数组吗?您还会提供创建输出数组的方法吗?从您的示例中并不明显。
-
@bassxzero 我想要每个数组的第一个元素,例如,如果您看到 5,4 和 3 是常见的,那么基于此再次循环检查每个元素,并再次在 5,4 和 3 下找到常见的元素构造数组..
-
@FirstOne,我尝试使用 array_shift 构造数组,然后基于第一个元素尝试再次检查每个元素,但它的工作只有 2 级,所以我以 3 级数组为例并输出..
标签: php arrays recursion combinations