1.用零到9十个数字构造一个二级目录,每个目录名字有2位数字如00/79并把所有的目录打印出来

WBOY
Libérer: 2016-06-13 12:51:09
original
896 Les gens l'ont consulté

1.用0到9十个数字构造一个二级目录,每个目录名字有2位数字如00/79并把所有的目录打印出来?
1.用0到9十个数字构造一个二级目录,每个目录名字有2位数字如00/79并把所有的目录打印出来?

lamp
------解决方案--------------------
<br />
<?php<br />
$tmp = range(0,99);<br />
$res = array();<br />
foreach($tmp as $val){<br />
	if($val < 10){<br />
		array_push($res,'0'.$val);<br />
	}else{<br />
		array_push($res,$val);<br />
	}<br />
}<br />
print_r($res);<br />
?><br />
#结果:<br />
Array ( [0] => 00 [1] => 01 [2] => 02 [3] => 03 [4] => 04 [5] => 05 [6] => 06 [7] => 07 [8] => 08 [9] => 09 [10] => 10 [11] => 11 [12] => 12 [13] => 13 [14] => 14 [15] => 15 [16] => 16 [17] => 17 [18] => 18 [19] => 19 [20] => 20 [21] => 21 [22] => 22 [23] => 23 [24] => 24 [25] => 25 [26] => 26 [27] => 27 [28] => 28 [29] => 29 [30] => 30 [31] => 31 [32] => 32 [33] => 33 [34] => 34 [35] => 35 [36] => 36 [37] => 37 [38] => 38 [39] => 39 [40] => 40 [41] => 41 [42] => 42 [43] => 43 [44] => 44 [45] => 45 [46] => 46 [47] => 47 [48] => 48 [49] => 49 [50] => 50 [51] => 51 [52] => 52 [53] => 53 [54] => 54 [55] => 55 [56] => 56 [57] => 57 [58] => 58 [59] => 59 [60] => 60 [61] => 61 [62] => 62 [63] => 63 [64] => 64 [65] => 65 [66] => 66 [67] => 67 [68] => 68 [69] => 69 [70] => 70 [71] => 71 [72] => 72 [73] => 73 [74] => 74 [75] => 75 [76] => 76 [77] => 77 [78] => 78 [79] => 79 [80] => 80 [81] => 81 [82] => 82 [83] => 83 [84] => 84 [85] => 85 [86] => 86 [87] => 87 [88] => 88 [89] => 89 [90] => 90 [91] => 91 [92] => 92 [93] => 93 [94] => 94 [95] => 95 [96] => 96 [97] => 97 [98] => 98 [99] => 99 ) <br />
Copier après la connexion


------解决方案--------------------
如果不止两级,那就需要多一此处理了。

<br>
// 递归目录名,理论上支持无限级目录,max是数字最大值<br>
function loopNames($level, $max)<br>
{<br>
    static $data;<br>
    static $name;<br>
<br>
    for($i = 0; $i 
    {<br>
        if ($level > 0) <div class="clear">
                 
              
              
        
            </div>
Copier après la connexion
Étiquettes associées:
source:php.cn
Déclaration de ce site Web
Le contenu de cet article est volontairement contribué par les internautes et les droits d'auteur appartiennent à l'auteur original. Ce site n'assume aucune responsabilité légale correspondante. Si vous trouvez un contenu suspecté de plagiat ou de contrefaçon, veuillez contacter admin@php.cn
Tutoriels populaires
Plus>
Derniers téléchargements
Plus>
effets Web
Code source du site Web
Matériel du site Web
Modèle frontal