我需要转换此类数组
$categoriesArray = array();
// ID, PARENT_ID, NAME
$categoriesArray[] = Category::create(1, 0, "Category A");
$categoriesArray[] = Category::create(2, 0, "Category B");
$categoriesArray[] = Category::create(3, 0, "Category C");
$categoriesArray[] = Category::create(4, 2, "Sub-cat F");
$categoriesArray[] = Category::create(5, 2, "Sub-Cat G");
$categoriesArray[] = Category::create(6, 3, "Sub-Cat H");
对此:
$x = new CategoryTree("Main");
$x->add_sub_cat(new CategoryTree($categoriesArray[0]->name)); //Category A
$x->add_sub_cat(new CategoryTree($categoriesArray[1]->name)); //Category B
$x->add_sub_cat(new CategoryTree($categoriesArray[2]->name)); //Category C
$x->subCats[1]->add_sub_cat(new CategoryTree($categoriesArray[3]->name)); //Sub-Cat F
$x->subCats[1]->add_sub_cat(new CategoryTree($categoriesArray[4]->name)); //Sub-Cat G
$x->subCats[2]->add_sub_cat(new CategoryTree($categoriesArray[5]->name)); //Sub-Cat H
subCat可以是无限的层次结构,所以我不知道会有多少层。我了解,这是必需的递归,但是我不知道如何将其转换为递归。
我需要这个,因为我正在做类别树,并且正在尝试制作一个表单,以添加类别(通过输入名称并选择父项)。
如果有什么方法可以将类别添加到第二个示例中,那将对我有很大帮助。
答案 0 :(得分:1)
显然您有一个这样的类(我在这里省略了私有成员声明):
$categoriesArray = [];
$categoriesArray[] = Category::create(1, 0, "Category A");
$categoriesArray[] = Category::create(2, 0, "Category B");
$categoriesArray[] = Category::create(3, 0, "Category C");
$categoriesArray[] = Category::create(4, 2, "Sub-cat F");
$categoriesArray[] = Category::create(5, 2, "Sub-Cat G");
$categoriesArray[] = Category::create(6, 3, "Sub-Cat H");
适用于您发布的代码:
class CategoryTree {
function __construct($name) {
$this->name = $name;
}
function add_sub_cat($catTree) {
$this->subCats[] = $catTree;
}
}
您似乎拥有一个类别树类,该类与此类似:
$x = new CategoryTree("Main");
$x->add_sub_cat(new CategoryTree($categoriesArray[0]->name)); //Category A
$x->add_sub_cat(new CategoryTree($categoriesArray[1]->name)); //Category B
$x->add_sub_cat(new CategoryTree($categoriesArray[2]->name)); //Category C
$x->subCats[1]->add_sub_cat(new CategoryTree($categoriesArray[3]->name)); //Sub-Cat F
$x->subCats[1]->add_sub_cat(new CategoryTree($categoriesArray[4]->name)); //Sub-Cat G
$x->subCats[2]->add_sub_cat(new CategoryTree($categoriesArray[5]->name)); //Sub-Cat H
重新输入您的代码:
object(CategoryTree)#7 (2) {
["name"]=>
string(4) "Main"
["subCats"]=>
array(3) {
[0]=>
object(CategoryTree)#8 (1) {
["name"]=>
string(10) "Category A"
}
[1]=>
object(CategoryTree)#9 (2) {
["name"]=>
string(10) "Category B"
["subCats"]=>
array(2) {
[0]=>
object(CategoryTree)#11 (1) {
["name"]=>
string(9) "Sub-cat F"
}
[1]=>
object(CategoryTree)#12 (1) {
["name"]=>
string(9) "Sub-Cat G"
}
}
}
[2]=>
object(CategoryTree)#10 (2) {
["name"]=>
string(10) "Category C"
["subCats"]=>
array(1) {
[0]=>
object(CategoryTree)#13 (1) {
["name"]=>
string(9) "Sub-Cat H"
}
}
}
}
}
您得到了:
// You need to make sure the array defines all parent categories first before
// sub categories can refer to them. This might already be the case, but we
// make that sure by sorting by parentId.
usort($categoriesArray, function($c1, $c2) { return $c1->parentId-$c2->parentId; });
// The trick is to build up a (flat) registry where you can simply add children
$x = new CategoryTree("Main");
$registry = [0 => $x]; // One entry: Main (parentId = 0)
foreach ($categoriesArray as $c) {
$catTree = new CategoryTree($c->name);
$registry[$c->id] = $catTree;
$registry[$c->parentId]->add_sub_cat($catTree);
}
后面的代码可以由动态执行的代码替换:
categoriesArray
顺便说一句:您没有类数组,=IFERROR(INDEX(F$2:F$9999, AGGREGATE(15, 6, ROW($1:$999)/((F$2:F$9999<>85)*(F$2:F$9999<>70)), ROW(1:1))),"")
是一个简单的(对象)数组。