


PHP recursively creates multi-level directories (the process of solving an interview question), php recursion_PHP tutorial
PHP recursively creates multi-level directories (the process of solving an interview question), PHP recursively
I saw an interview question today and asked me to write a method that can create multi-level directories. Function:
My first impression is to use recursion to create, the specific idea is as follows:
<span>function</span> Directory(<span>$dir</span><span>){ </span><span> if</span>(<span>is_dir</span>(<span>$dir</span>) || @<span>mkdir</span>(<span>$dir</span>,0777)){ <span>//</span><span>查看目录是否已经存在或尝试创建,加一个@抑制符号是因为第一次创建失败,会报一个“父目录不存在”的警告。</span> <span>echo</span> <span>$dir</span>."创建成功<br>"; <span>//</span><span>输出创建成功的目录</span> <span> }</span><span>else</span><span>{ </span><span>$dirArr</span>=<span>explode</span>('/',<span>$dir</span>); <span>//</span><span>当子目录没创建成功时,试图创建父目录,用explode()函数以'/'分隔符切割成一个数组</span> <span>array_pop</span>(<span>$dirArr</span>); <span>//</span><span>将数组中的最后一项(即子目录)弹出来,</span> <span>$newDir</span>=<span>implode</span>('/',<span>$dirArr</span>); <span>//</span><span>重新组合成一个文件夹字符串</span> <span> Directory(</span><span>$newDir</span>); <span>//</span><span>试图创建父目录</span> <span>if</span>(@<span>mkdir</span>(<span>$dir</span>,0777<span>)){ </span><span>echo</span> <span>$dir</span>."创建成功<br>"<span>; } </span><span>//</span><span>再次试图创建子目录,成功输出目录名</span> <span> } } Directory(</span>"A/B/C/D/E/F");
The output result is as shown below:
But it can be seen that it is too troublesome to write. Looking at the file functions in the manual, I saw a dirname() function, whose prototype is as follows:
<p>string dirname ( string $path )</p> <p>给出一个包含有指向一个文件的全路径的字符串,本函数返回去掉文件名后的目录名。 </p> <p>在 Windows 中,斜线(/)和反斜线(\)都可以用作目录分隔符。在其它环境下是斜线(/)。</p>
Can be slightly optimized:
<span>function</span> Directory(<span>$dir</span><span>){ </span><span>if</span>(<span>is_dir</span>(<span>$dir</span>) || @<span>mkdir</span>(<span>$dir</span>,0777<span>)){ </span><span>echo</span> <span>$dir</span>."创建成功<br>"<span>; }</span><span>else</span><span>{ Directory(</span><span>dirname</span>(<span>$dir</span><span>)); </span><span>if</span>(@<span>mkdir</span>(<span>$dir</span>,0777<span>)){ </span><span>echo</span> <span>$dir</span>."创建成功<br>"<span>; } } }</span>
The effect is the same.
Afterwards, I searched for answers on the Internet and found an extremely insightful one:
<span>function</span> Directory( <span>$dir</span><span> ){ </span><span>return</span> <span>is_dir</span> ( <span>$dir</span> ) or Directory(<span>dirname</span>( <span>$dir</span> )) and <span>mkdir</span> ( <span>$dir</span> , 0777<span>); }</span>
Now let’s explain the whole function:
First introduce the priority order of logical operators in PHP: && > || > and > or , that is, symbolic type > letter type, AND type >OR type, so the function body can be seen as:
is_dir ( $dir ) or (Directory(dirname( $dir )) and mkdir ( $dir , 0777));
First determine whether the target directory exists. If it exists, depending on the short-circuit characteristics of or, the entire following will be short-circuited and execution will be skipped; if the target directory does not exist, the following function body will be executed:
Directory(dirname( $dir )) and mkdir ( $dir , 0777)
I considered the purpose of performing recursion first: performing recursion first is to confirm that its parent directory (dirname($dir)) has been created so that the subsequent mkdir() function will not be unable to find the subdirectory when it is created. to the parent directory to issue a warning.
After entering the depth of the recursion, confirm that the deepest root directory exists, and then create directories from the root directory downwards.
Finally, I suggest those who are looking for a job to go online and find some interview questions from large companies to do. After all, their exams are more comprehensive and in-depth. When learning knowledge, you should also brush up on the questions, and you must also do it. , because it’s easy to have too much ambition but too little. I optimized the function at the beginning several times before it could be used normally.
I will also find some interesting interview questions to share with you in the future.
If you think this blog post is helpful to you, you can recommend or follow me. If you have any questions, you can leave a message below for discussion. Thank you.

Hot AI Tools

Undresser.AI Undress
AI-powered app for creating realistic nude photos

AI Clothes Remover
Online AI tool for removing clothes from photos.

Undress AI Tool
Undress images for free

Clothoff.io
AI clothes remover

Video Face Swap
Swap faces in any video effortlessly with our completely free AI face swap tool!

Hot Article

Hot Tools

Notepad++7.3.1
Easy-to-use and free code editor

SublimeText3 Chinese version
Chinese version, very easy to use

Zend Studio 13.0.1
Powerful PHP integrated development environment

Dreamweaver CS6
Visual web development tools

SublimeText3 Mac version
God-level code editing software (SublimeText3)

Hot Topics



The recursion depth of C++ functions is limited, and exceeding this limit will result in a stack overflow error. The limit value varies between systems and compilers, but is usually between 1,000 and 10,000. Solutions include: 1. Tail recursion optimization; 2. Tail call; 3. Iterative implementation.

Yes, C++ Lambda expressions can support recursion by using std::function: Use std::function to capture a reference to a Lambda expression. With a captured reference, a Lambda expression can call itself recursively.

The recursive algorithm solves structured problems through function self-calling. The advantage is that it is simple and easy to understand, but the disadvantage is that it is less efficient and may cause stack overflow. The non-recursive algorithm avoids recursion by explicitly managing the stack data structure. The advantage is that it is more efficient and avoids the stack. Overflow, the disadvantage is that the code may be more complex. The choice of recursive or non-recursive depends on the problem and the specific constraints of the implementation.

Given two strings str_1 and str_2. The goal is to count the number of occurrences of substring str2 in string str1 using a recursive procedure. A recursive function is a function that calls itself within its definition. If str1 is "Iknowthatyouknowthatiknow" and str2 is "know" the number of occurrences is -3. Let us understand through examples. For example, input str1="TPisTPareTPamTP", str2="TP"; output Countofoccurrencesofasubstringrecursi

We take the integer array Arr[] as input. The goal is to find the largest and smallest elements in an array using a recursive method. Since we are using recursion, we will iterate through the entire array until we reach length = 1 and then return A[0], which forms the base case. Otherwise, the current element is compared to the current minimum or maximum value and its value is updated recursively for subsequent elements. Let’s look at various input and output scenarios for this −Input −Arr={12,67,99,76,32}; Output −Maximum value in the array: 99 Explanation &mi

Python is a programming language that is easy to learn and use. However, when using Python to write recursive functions, you may encounter errors in which the recursion depth is too large. This problem needs to be solved. This article will show you how to solve Python's maximum recursion depth error. 1. Understand recursion depth. Recursion depth refers to the number of layers of nested recursive functions. By default in Python, the limit of recursion depth is 1000. If the number of recursion levels exceeds this limit, the system will report an error. This error is often called the "maximum recursion depth error"

How to use Vue form processing to implement recursive nesting of forms Introduction: As the complexity of front-end data processing and form processing continues to increase, we need a flexible way to handle complex forms. As a popular JavaScript framework, Vue provides us with many powerful tools and features to handle recursive nesting of forms. This article will introduce how to use Vue to handle such complex forms, and attach code examples. 1. Recursive nesting of forms In some scenarios, we may need to deal with recursive nesting.

A recursive function is a technique that calls itself repeatedly to solve a problem in string processing. It requires a termination condition to prevent infinite recursion. Recursion is widely used in operations such as string reversal and palindrome checking.
