dryeyhe0266 2015-01-13 08:40
浏览 25
已采纳

输出堆为树PHP

I have an array $heap = array(9, 9, 9, 8, 9, 9, 8, 9, 9, 9, 9, 9, 8, 8, 9, 7, 9, 8, 8, 9, 9,); and I want to output It like binary tree, when the two children nodes we can know by this formulas, $heap[$key*2+1] and second $heap[$key*2+2]. I try to run using foreach but getting error about undefined offset 21. Here is foreach:

foreach ($heap as $key => $value) {
    echo $value;
    if ($key != count($heap)) {
        echo $heap[$key*2+1];
        echo $heap[$key*2+2];
    }
}

What I am doing wrong and how I can solve this?

  • 写回答

3条回答 默认 最新

  • dpzyd8865 2015-01-13 08:44
    关注

    I think the error in your check:

    if ($key != count($heap)) {
        echo $heap[$key*2+1];
        echo $heap[$key*2+2];
    }
    

    Here may be a situation with $key*2+2 is out of bounds the array. Add the check for it too. Try to use bool array_key_exists ( mixed $key , array $array ), something like this:

    if ($key != count($heap)) {
        if (array_key_exists($key*2 + 1, $heap)) echo $heap[$key*2 + 1];
        if (array_key_exists($key*2 + 2, $heap) ) echo $heap[$key*2 + 2];
    }
    

    As you point out in comment, you are doubling the values in your code. This can be avoided by recursive function, something like this (pseudocode):

    printArray(i, aHeap) {
        if (i < count($heap)) {
            echo $heap[i];
            printArray(2*i + 1, aHeap);
            printArray(2*i + 2, aHeap);
        }
    }
    
    本回答被题主选为最佳回答 , 对您是否有帮助呢?
    评论
查看更多回答(2条)

报告相同问题?

悬赏问题

  • ¥15 如何在scanpy上做差异基因和通路富集?
  • ¥20 关于#硬件工程#的问题,请各位专家解答!
  • ¥15 关于#matlab#的问题:期望的系统闭环传递函数为G(s)=wn^2/s^2+2¢wn+wn^2阻尼系数¢=0.707,使系统具有较小的超调量
  • ¥15 FLUENT如何实现在堆积颗粒的上表面加载高斯热源
  • ¥30 截图中的mathematics程序转换成matlab
  • ¥15 动力学代码报错,维度不匹配
  • ¥15 Power query添加列问题
  • ¥50 Kubernetes&Fission&Eleasticsearch
  • ¥15 報錯:Person is not mapped,如何解決?
  • ¥15 c++头文件不能识别CDialog