php 遍历复杂的帖子

Question

我是网络编程的新手，我的工作中到处都是如此复杂的帖子，这是 var_dump($_POST) 的结果，我正在使用 gettype() 函数来确定值是否在$arr 数组是否是另一个数组，我不方便我的代码的这种行为，也不是我在循环插入时总是遇到的问题

问题是是否有更智能的技术可以像这个复杂的帖子一样循环，其次如何在调用 assistant 的二维数组中捕获名称phone（称为 assistant['name'],assistant[phone])

<?php

    $arr = array(
                 "name"=> "mmmkkkk", 
                 "phones"=> array(
                                  "01553338897" , 
                                  "09090909098"
                                 ), 
                 "address"=> "107 ostras., Germany", 
                 "assistant"=> array(
                                      "name" => array(
                                                      "kmkkm",
                                                      "komar"
                                                     ), 
                                      "phone"=> array(
                                                      "01043338897" , 
                                                      "09099090090"
                                                     )
                                   )
                );

    foreach($arr as $key => $p_value)
    {
            if(gettype($p_value)=="array")
            {
                echo $key.":"."</br>";

                foreach($p_value as $newp_value => $val )
                {
                    if(gettype($val)=="array")
                    {
                        foreach($val as $vkey)
                        {
                            echo $vkey."</br>"; 
                        }
                    }
                    else{echo $val."</br>";}
                }       

            }else{echo $key.":".$p_value."</br>";}
    }   

    ?>

Answer 1

您可以像这样使用 Recursive 函数。

<?php
    $arr = array(
                 "name"=> "mmmkkkk", 
                 "phones"=> array(
                                  "01553338897" , 
                                  "09090909098"
                                 ), 
                 "address"=> "107 ostras., Germany", 
                 "assistant"=> array(
                                      "name" => array(
                                                      "kmkkm",
                                                      "komar"
                                                     ), 
                                      "phone"=> array(
                                                      "01043338897" , 
                                                      "09099090090"
                                                     )
                                   )
                );

    function rec($arr) {

        foreach($arr as $key => $p_value)
        {
            if (is_array($p_value)) {
                rec($p_value);
            } else {
                echo $key.":".$p_value."\n";
            }
        }

    }

    rec($arr);

?>

Answer 2

考虑递归

function walkThrough($array, $tabulation = 0) {
    foreach($array as $key => $value) {
        printf ('%s%s:', str_repeat(4*$tabulation, '&nbsp;'));

        if (is_array($value))   walkThrough ( $value, ($tabulation+1) );
        else                   printf('%s<br />', $value);
    }
}

Answer 3

使用这个递归函数

function recursivefunc($arr,$key =''){
if(is_array($arr)){
    foreach($arr as $k => $v){
        if (is_array($v) && !empty($v)) {
            recursivefunc($v,$k);
        } else {
            $keys = ($key=='') ? $k : $key;
            echo $keys.":".$v.'</br>';
        }
    }
}
}
recursivefunc($arr);

输出：

name:mmmkkkk
phones:01553338897
phones:09090909098
address:107 ostras., Germany
name:kmkkm
name:komar
phone:01043338897
phone:09099090090

php 遍历复杂的帖子

php loop through complex posts

php

associative-array