给定下一个数组:
$array = Array(
"0" => Array
(
"id" => 1,
"parent_id" => 0,
"name" => "Category A"
),
"1" => Array
(
"id" => 2,
"parent_id" => 1,
"name" => "Subcategory A1"
),
"2" => Array
(
"id" => 3,
"parent_id" => 2,
"name" => "Sub-Subcategory A1"
),
"3" => Array
(
"id" => 4,
"parent_id" => 1,
"name" => "Subcategory A2"
),
"4" => Array
(
"id" => 5,
"parent_id" => 0,
"name" => "Category B"
),
"5" => Array
(
"id" => 6,
"parent_id" => 5,
"name" => "Subcategory B"
)
);
类似的东西:
$tabOfElements = array();
foreach($array as $element){
$tabOfElements[$element['id']] = (isset($tabOfElements[$element['parent_id']])?$tabOfElements[$element['parent_id']].'/':'').$element['name'];
}
$stringOfCategories = implode(',',$tabOfElements);
应该做你需要的。注意:这仅适用于父母类别总是在数组中的孩子之前。
编辑:
要仅获取所有最后一个类别的子路径,您可以这样做:
$tabOfElements = array();
$elementsToDelete = array();
foreach($array as $element){
$tabOfElements[$element['id']] = (isset($tabOfElements[$element['parent_id']])?$tabOfElements[$element['parent_id']].'/':'').$element['name'];
if(isset($tabOfElements[$element['parent_id']]) && !isset($elementsToDelete[$element['parent_id']])){
$elementsToDelete[$element['parent_id']] = $element['parent_id'];
}
}
$finalArray = array_diff_key($tabOfElements, $elementsToDelete);
$stringOfCategories = implode(',',$finalArray);
这会给你:
Category A/Subcategory A1/Sub-Subcategory A1,Category A/Subcategory A2,Category B/Subcategory B
编辑 2:
使用您提供的第二个数组,您可以使用递归函数,例如:
function recursiveFunction($elementArray, $parentString = ''){
if(isset($elementArray['children']) && !empty($elementArray['children'])){
foreach($elementArray['children'] as $keyChild=>$child){
$resultString .= recursiveFunction($child, $parentString.$elementArray['name'].'/').(($keyChild<count($elementArray['children'])-1)?',':'');
}
return $resultString;
}else{
return $parentString.$elementArray['name'];
}
}
$tabOfPaths = array();
foreach($array as $elementArray){
$tabOfPaths[] = recursiveFunction($elementArray);
}
$stringOfPaths = implode(',',$tabOfPaths);
echo $stringOfPaths;
希望对你有帮助。