2023年7月12日 23:06:39go评论59阅读模式

英文:

JSON Tree PHP using a recursive function

问题

问题在于每个子元素都与每个父元素绑定在一起，这就是为什么一切都重复了。

$json = '[
    {"id":3633,"name":"Mobile phones and accessories","left":1,"right":18,"level":1,"elements":0},
    {"id":3638,"name":"Mobile phones","left":2,"right":3,"level":2,"elements":174},
    
    {"id":21396,"name":"Tablets","left":19,"right":24,"level":1,"elements":0},
    {"id":21450,"name":"Some Tablets","left":20,"right":21,"level":2,"elements":8}
]';

$data = json_decode($json, true);

function buildTree($data, $level = 1) {
    $tree = array();

    foreach ($data as $item) {
        if ($item['level'] == $level) {
            $node = array(
                'item' => $item,
                'children' => buildTree($data, $level + 1),
            );

            $tree[] = $node;
        }
    }

    return $tree;
}

$tree = buildTree($data);

print_r($tree);

原来这是元素的输出。

现在，每个级别为2的元素都与每个级别为1的元素绑定在一起，但不应该有重复。

可以做些什么改变，以使所有元素都是唯一的，并且只属于一个父元素？

英文:

The problem is that each child element is bound to each parent element, which is why everything is duplicated

&lt;?php
$json = &#39;[
{&quot;id&quot;:3633,&quot;name&quot;:&quot;Mobile phones and accessories&quot;,&quot;left&quot;:1,&quot;right&quot;:18,&quot;level&quot;:1,&quot;elements&quot;:0},
{&quot;id&quot;:3638,&quot;name&quot;:&quot;Mobile phones&quot;,&quot;left&quot;:2,&quot;right&quot;:3,&quot;level&quot;:2,&quot;elements&quot;:174},
{&quot;id&quot;:21396,&quot;name&quot;:&quot;Tablets&quot;,&quot;left&quot;:19,&quot;right&quot;:24,&quot;level&quot;:1,&quot;elements&quot;:0},
{&quot;id&quot;:21450,&quot;name&quot;:&quot;Some Tablets&quot;,&quot;left&quot;:20,&quot;right&quot;:21,&quot;level&quot;:2,&quot;elements&quot;:8}
]&#39;;
$data = json_decode($json, true);
function buildTree($data, $level = 1) {
$tree = array();
foreach ($data as $item) {
if ($item[&#39;level&#39;] == $level) {
$node = array(
&#39;item&#39; =&gt; $item,
&#39;children&#39; =&gt; buildTree($data, $level + 1),
);
$tree[] = $node;
}
}
return $tree;
}
$tree = buildTree($data);
print_r($tree);
?&gt;

It turns out that this is the output of the elements

Array
(
[0] =&gt; Array
(
[item] =&gt; Array
(
[id] =&gt; 3633
[name] =&gt; Mobile phones and accessories
[left] =&gt; 1
[right] =&gt; 18
[level] =&gt; 1
[elements] =&gt; 0
)
[children] =&gt; Array
(
[0] =&gt; Array
(
[item] =&gt; Array
(
[id] =&gt; 3638
[name] =&gt; Mobile phones
[left] =&gt; 2
[right] =&gt; 3
[level] =&gt; 2
[elements] =&gt; 174
)
[children] =&gt; Array
(
)
)
[1] =&gt; Array
(
[item] =&gt; Array
(
[id] =&gt; 21450
[name] =&gt; Some Tablets
[left] =&gt; 20
[right] =&gt; 21
[level] =&gt; 2
[elements] =&gt; 8
)
[children] =&gt; Array
(
)
)
)
)
[1] =&gt; Array
(
[item] =&gt; Array
(
[id] =&gt; 21396
[name] =&gt; Tablets
[left] =&gt; 19
[right] =&gt; 24
[level] =&gt; 1
[elements] =&gt; 0
)
[children] =&gt; Array
(
[0] =&gt; Array
(
[item] =&gt; Array
(
[id] =&gt; 3638
[name] =&gt; Mobile phones
[left] =&gt; 2
[right] =&gt; 3
[level] =&gt; 2
[elements] =&gt; 174
)
[children] =&gt; Array
(
)
)
[1] =&gt; Array
(
[item] =&gt; Array
(
[id] =&gt; 21450
[name] =&gt; Some Tablets
[left] =&gt; 20
[right] =&gt; 21
[level] =&gt; 2
[elements] =&gt; 8
)
[children] =&gt; Array
(
)
)
)
)
)

Now I have every element with level = 2 tied to every element with level = 1
But there should be no duplication

What can be changed so that all elements are unique and belong to only one parent

答案1

得分: 1

我看到你的代码中有两个问题：

它没有处理当$level大于$item['level']的情况。
递归调用使用相同的数组作为第一个参数，但这样做不会保留“指针”位置，并且在每次调用时都会从头开始扫描整个数组。

对于第一个问题，一个简单的if语句足以解决问题。
对于第二个问题，我建议在不同调用之间使用迭代器来代替数组来保持指针位置。

$data = new ArrayIterator(json_decode($json, true));

function buildTree(iterator $data, int $level = 1): array {
    
    $tree = [];
  
    while ($data->valid()) {
        $item = $data->current();
        
        if ($item['level'] < $level)
            return $tree;
  
        if ($item['level'] === $level) {
            $data->next();
            
            $tree[] = [
                'item' => $item,
                'children' => buildTree($data, $level + 1)
            ];
        }
    }

    return $tree;
}

这段代码适用于PHP 8.x，如果需要在旧版本中使用，可以删除函数签名中的类型声明。

英文:

I see two problems in your code:

it doesn't handle the case when $level is greater than $item['level']
the recursive call uses the same array as first parameter, but doing that doesn't preserve the "pointer" position, and the entire array is scanned at each call from the beginning.

For the first point, a simple if suffices to solve the problem.
For the second point I suggest to use an iterator in place of an array to keep the pointer positions trough the different calls.

$data = new ArrayIterator(json_decode($json, true));
function buildTree(iterator $data, int $level = 1): array {
$tree = [];
while ($data-&gt;valid()) {
$item = $data-&gt;current();
if ($item[&#39;level&#39;] &lt; $level)
return $tree;
if ($item[&#39;level&#39;] === $level) {
$data-&gt;next();
$tree[] = [
&#39;item&#39; =&gt; $item,
&#39;children&#39; =&gt; buildTree($data, $level + 1)
];
}
}
return $tree;
}

demo

This code is written for PHP 8.x, feel free to remove the types in the function signature to make it work with older versions.

答案2

得分: 0

如果您希望按顺序解析它，所有级别1的项目都是兄弟姐妹，否则每个项目都是前一个项目的子项目，那么这里是一个JavaScript伪代码。

var arr = [
    {"id":3633,"name":"Mobile phones and accessories","left":1,"right":18,"level":1,"elements":0},
    {"id":3638,"name":"Mobile phones","left":2,"right":3,"level":2,"elements":174},
    {"id":3639,"name":"Mobile phones 2","left":2,"right":3,"level":3,"elements":174},
    
    {"id":21396,"name":"Tablets","left":19,"right":24,"level":1,"elements":0},
    {"id":21450,"name":"Some Tablets","left":20,"right":21,"level":2,"elements":8}
];

var result = [];

var previous = null;
arr.forEach(function(item) {
  if (item.level == 1) {
    result.push({item})
    previous = item;
  } else {
    previous.children = previous.children || []
    previous.children.push({item})
    previous = item;
  }
})

console.log(result)

请注意，此代码片段是JavaScript的伪代码示例，用于解释结构。

英文:

If you want it by parsed by order, all level 1 are siblings, and otherwise each item is a child of the previous then here's a javascript pseudo-code.

var arr = [
{&quot;id&quot;:3633,&quot;name&quot;:&quot;Mobile phones and accessories&quot;,&quot;left&quot;:1,&quot;right&quot;:18,&quot;level&quot;:1,&quot;elements&quot;:0},
{&quot;id&quot;:3638,&quot;name&quot;:&quot;Mobile phones&quot;,&quot;left&quot;:2,&quot;right&quot;:3,&quot;level&quot;:2,&quot;elements&quot;:174},
{&quot;id&quot;:3639,&quot;name&quot;:&quot;Mobile phones 2&quot;,&quot;left&quot;:2,&quot;right&quot;:3,&quot;level&quot;:3,&quot;elements&quot;:174},
{&quot;id&quot;:21396,&quot;name&quot;:&quot;Tablets&quot;,&quot;left&quot;:19,&quot;right&quot;:24,&quot;level&quot;:1,&quot;elements&quot;:0},
{&quot;id&quot;:21450,&quot;name&quot;:&quot;Some Tablets&quot;,&quot;left&quot;:20,&quot;right&quot;:21,&quot;level&quot;:2,&quot;elements&quot;:8}
];
var result = [];
var previous = null;
arr.forEach(function(item) {
if (item.level == 1) {
result.push({item})
previous = item;
} else {
previous.children = previous.children || []
previous.children.push({item})
previous = item;
}
})
console.log(result)

通过集体智慧和协作来改善编程学习和解决问题的方式。致力于成为全球开发者共同参与的知识库，让每个人都能够通过互相帮助和分享经验来进步。

JSON树 PHP使用递归函数

问题

答案1

答案2

I am looking to add a new div/block above single product pages in woocommerce that shows the featured product in full width below header

没有找到适合的方法进行排序。

PHP header()函数是否缓存重定向，如果是的话，如何防止它缓存？

调用父类 PHP 类上的子类方法

What's the correct way to type hint an empty list as a literal in python?

如何在Highcharts Gantt中更改本地化的星期名称

如何在同一个流中使用多个过滤器和映射函数？

如何使用Map/Set来将代码优化到O(n)？

.NET MAUI Android在GitHub Actions上构建失败，错误代码为1。

如何在Playwright视觉比较中屏蔽多个定位器？

在C++中，可以使用可变模板参数来检索类型的内部类型。

selenium.common.exceptions.StaleElementReferenceException: Message: stale element reference: stale element not found

Creating and opening a URL to log in to Website via Basic Auth with Robot Framework/Selenium (Python)

AG Grid 在上下文菜单中以大文本形式打开

发表评论