0

这是我的数组:

$array = array (
'1' => array(
  'title' => 'Level1',
  'nodes' => array(
   '11' => array('title' => 'sub1_company1'),
   '12' => array('title' => 'sub2_company1'),
   '13' => array(
     'title' => 'sub3_company1',
     'nodes' => array(
       '131' => array('title' => 'item1_sub3_company1'),
       '132' => array('title' => 'item2_sub3_company1'),
      ),
    ),
  ),
),

'2' => array(
  'title' => 'Level2',
  'nodes' => array(
   '21' => array('title' => 'sub1_company2'),
   '22' => array('title' => 'sub2_company2'),
  ),
),

'3' => array(
  'title' => 'Level3',
  'nodes' => array(
   '31' => array('title' => 'sub1_company3'),
   '32' => array(
     'title' => 'sub2_company3',
     'nodes' => array(
       '321' => array('title' => 'item1_sub2_company3'),
       '322' => array(
          'title' => 'item2_sub2_company3',
          'nodes' => array(
            '3221' => array('title' => 'item1_sub3_company3'),
          ),
        ),
      ),
    ),
  ),
),
'4' => array('title' => 'Level4'),);

我需要的是找到 sub2_company1 并获得像面包屑一样的标题。

级别 1 > sub2_company1

或者如果我搜索 item1_sub3_company1 我会得到

级别 1 > sub3_company1 > item1_sub3_company1

到目前为止我做了什么但没有工作:

    function breadcrumb($array, $needle) {
  $path = array();

  $array_iterator = new recursiveArrayIterator($array);
  $it = new recursiveIteratorIterator($array_iterator, RecursiveIteratorIterator::SELF_FIRST);

  foreach($it as $key => $value) 
  {
    echo "$key: $value <br>";
    if (!is_array($value)) {
      array_push($path, $value);
    }
    if ($value === $needle) {
      break;
    }
  }

  //$content = '<div id="breadcrumb">' . implode('&nbsp;&#62;&nbsp;', $path) . '</div>';

  return print_r($path, 1);
}

谢谢你

4

1 回答 1

2

您需要一个递归函数,而不是迭代函数。

function breadcrumb($tree, $needle, &$result = array()) {

    $result = array();

    if (is_array($tree)) {
        foreach ($tree as $node) {
            if ($node['title'] == $needle) {
                $result[] = $node['title'];
                echo '1-';
                return true;
            } else if (!empty($node['nodes'])) {
                if (breadcrumb($node['nodes'], $needle, $result)){
                echo '2-';
                $result[] = $node['title'];
                return true;
                }
            }
        }
    } else {
        if ($tree == $needle) {
            echo '3-';
            $result[] = $tree;
            return true;
        }
    }
    return false;
}

breadcrumb($array, 'item1_sub3_company3', $result);

print_r($result);

面包屑是倒置的,但是您可以使用 array_shift 而不是 push 并且您会以正确的方式使用它...

于 2012-04-30T20:09:23.597 回答