entityMap|blocks|key|4t4qg|text|对于父/子元素，您还需要做更多的工作，但要让它在一开始工作，只需用额外的array()解包数组，并访问基于不带$key的元素，如下所示：|type|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|data|6vi7p|$lists+=+array(
++++array(
++++++++'id'+=>+1,
++++++++'parent'+=>+0,
++++++++'name'+=>+'Menu+1',
++++),
++++array(
++++++++'id'+=>+2,
++++++++'parent'+=>+1,
++++++++'name'+=>+'Menu+2',
++++),
++++array(
++++++++'id'+=>+3,
++++++++'parent'+=>+2,
++++++++'name'+=>+'Menu+3',
++++),
++++array(
++++++++'id'+=>+4,
++++++++'parent'+=>+1,
++++++++'name'+=>+'Menu+4',
++++),
++++array(
++++++++'id'+=>+4,
++++++++'parent'+=>+0,
++++++++'name'+=>+'Menu+5',
++++)
);
?>
<ul>
<li><a>My+List</a>
++++<ul>
++++++++<?php
++++++++foreach($lists+as+$key=>$list)+{
++++++++++++?>
++++++++++++<li><a><?=+$list['name'];+?></a></li>
++++++++++++<?php
++++++++}
++++++++?>
++++</ul>
</li>|code-block|syntax|javascript|2a05u^0|10|7|1J|4|0|0^^$0|$]|1|@$2|3|4|5|6|7|8|M|9|@$A|N|B|O|C|D]|$A|P|B|Q|C|D]]|E|@]|F|$]]|$2|G|4|H|6|I|8|R|9|@]|E|@]|F|$J|K]]|$2|L|4|-4|6|7|8|S|9|@]|E|@]|F|$]]]]

You've still got a bit more to do for the parent/child thing, but to get it working initially, just unwrap the array with the extra <code>array()</code> and access the element based without the <code>$key</code> like so:

<pre><code>$lists = array(
 array(
 'id' =&gt; 1,
 'parent' =&gt; 0,
 'name' =&gt; 'Menu 1',
 ),
 array(
 'id' =&gt; 2,
 'parent' =&gt; 1,
 'name' =&gt; 'Menu 2',
 ),
 array(
 'id' =&gt; 3,
 'parent' =&gt; 2,
 'name' =&gt; 'Menu 3',
 ),
 array(
 'id' =&gt; 4,
 'parent' =&gt; 1,
 'name' =&gt; 'Menu 4',
 ),
 array(
 'id' =&gt; 4,
 'parent' =&gt; 0,
 'name' =&gt; 'Menu 5',
 )
);
?&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a&gt;My List&lt;/a&gt;
 &lt;ul&gt;
 &lt;?php
 foreach($lists as $key=&gt;$list) {
 ?&gt;
 &lt;li&gt;&lt;a&gt;&lt;?= $list['name']; ?&gt;&lt;/a&gt;&lt;/li&gt;
 &lt;?php
 }
 ?&gt;
 &lt;/ul&gt;
&lt;/li&gt;
</code></pre>

entityMap|0|type|LINK|mutability|MUTABLE|data|url|https://3v4l.org/hZ07j|blocks|key|1kctf|text|你确实需要一个递归函数来构建这棵树。这里有一个可以做你想做的事情。请注意，它考虑了额外的(不必要的？)如果输入数据中的数组层不存在，则从函数中对$lists的引用中删除[0]：|unstyled|depth|inlineStyleRanges|offset|length|style|CODE|entityRanges|5btje|function+make_list($lists,+$parent+=+0)+{
++++$children+=+array_filter($lists[0],+function+($v)+use($parent)+{+return+$v['parent']+==+$parent;+});
++++if+(!count($children))+return;
++++echo+"<ul>\n";
++++foreach+($children+as+$child)+{
++++++++echo+"<li>{$child['name']}</li>\n";
++++++++make_list($lists,+$child['id']);
++++}
++++echo+"</ul>\n";
}

make_list($lists);|code-block|syntax|javascript|fiuit|输出：|dq7hq|<ul>
++<li>Menu+1</li>
++<ul>
++++<li>Menu+2</li>
++++<ul>
++++++<li>Menu+3</li>
++++</ul>
++++<li>Menu+4</li>
++</ul>
++<li>Menu+5</li>
</ul>|4mf7k|Demo+on+3v4l.org|cd40a^0|20|6|2C|3|0|0|0|0|0|G|0|0^^$0|$1|$2|3|4|5|6|$7|8]]]|9|@$A|B|C|D|2|E|F|Y|G|@$H|Z|I|10|J|K]|$H|11|I|12|J|K]]|L|@]|6|$]]|$A|M|C|N|2|O|F|13|G|@]|L|@]|6|$P|Q]]|$A|R|C|S|2|E|F|14|G|@]|L|@]|6|$]]|$A|T|C|U|2|O|F|15|G|@]|L|@]|6|$P|Q]]|$A|V|C|W|2|E|F|16|G|@]|L|@$H|17|I|18|A|19]]|6|$]]|$A|X|C|-4|2|E|F|1A|G|@]|L|@]|6|$]]]]

You really need a recursive function to build this tree. Here is one that will do what you want. Note that it takes account of the extra (unnecessary?) array layer that you have in your input data, if that doesn't actually exist remove the <code>[0]</code> from the reference to <code>$lists</code> in the function:

<pre><code>function make_list($lists, $parent = 0) {
 $children = array_filter($lists[0], function ($v) use($parent) { return $v['parent'] == $parent; });
 if (!count($children)) return;
 echo "&lt;ul&gt;\n";
 foreach ($children as $child) {
 echo "&lt;li&gt;{$child['name']}&lt;/li&gt;\n";
 make_list($lists, $child['id']);
 }
 echo "&lt;/ul&gt;\n";
}

make_list($lists);
</code></pre>

Output:

<pre><code>&lt;ul&gt;
 &lt;li&gt;Menu 1&lt;/li&gt;
 &lt;ul&gt;
 &lt;li&gt;Menu 2&lt;/li&gt;
 &lt;ul&gt;
 &lt;li&gt;Menu 3&lt;/li&gt;
 &lt;/ul&gt;
 &lt;li&gt;Menu 4&lt;/li&gt;
 &lt;/ul&gt;
 &lt;li&gt;Menu 5&lt;/li&gt;
&lt;/ul&gt;
</code></pre>

<a href="https://3v4l.org/hZ07j" rel="nofollow noreferrer">Demo on 3v4l.org</a>

I want to generate a tree with html elements "ul" and "li". I want the final result to look something like this.

<pre><code>My List
 Menu 1
 Menu 2
 Menu 3
 Menu 4
 Menu 5
</code></pre>

But when I run my code the result looks something like this:

<pre><code>My List
 Menu 1
</code></pre>

Here is my PHP array code:

<pre><code>$lists = array(array(
 array(
 'id' =&gt; 1,
 'parent' =&gt; 0,
 'name' =&gt; 'Menu 1',
 ),
 array(
 'id' =&gt; 2,
 'parent' =&gt; 1,
 'name' =&gt; 'Menu 2',
 ),
 array(
 'id' =&gt; 3,
 'parent' =&gt; 2,
 'name' =&gt; 'Menu 3',
 ),
 array(
 'id' =&gt; 4,
 'parent' =&gt; 1,
 'name' =&gt; 'Menu 4',
 ),
 array(
 'id' =&gt; 4,
 'parent' =&gt; 0,
 'name' =&gt; 'Menu 5',
 )
));
?&gt;
&lt;ul&gt;
&lt;li&gt;&lt;a&gt;My List&lt;/a&gt;
 &lt;ul&gt;
 &lt;?php
 foreach($lists as $key=&gt;$list) {
 ?&gt;
 &lt;li&gt;&lt;a&gt;&lt;?= $list[$key]['name']; ?&gt;&lt;/a&gt;&lt;/li&gt;
 &lt;?php
 }
 ?&gt;
 &lt;/ul&gt;
&lt;/li&gt;
&lt;/ul&gt;
</code></pre>

Build a list tree with an array

 我想生成一个包含html元素"ul“和"li”的树。我希望最终的结果看起来像这样。 My List    Menu 1        Menu 2            Menu 3        Menu 4    Menu 5 但是当我运行我的代码时，结果如下所示： My List    Menu 1 下面是我的...

问使用数组构建列表树
EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问使用数组构建列表树EN

社区

活动

资源

关于

腾讯云开发者

热门产品

热门推荐

更多推荐

问使用数组构建列表树
EN