例如，我有数组
Array
(
[0] => folder1/file1.txt
[1] => folder1/file2.txt
[2] => file2.txt
[3] => folder2/file1.txt
[4] => folder1/subfolder1/file1.txt
[5] => folder1/subfolder2/file2.txt
[6] => file1.txt
[7] => file3.txt
[8] => folder1/subfolder2/file1.txt
)
我需要一条线索来弄清楚如何根据给定的值创建"目录树"数组，它可能看起来像这样：
Array
(
[folder1] => Array
(
[0] => file1.txt
[1] => file2.txt
[subfolder1] => Array
(
[0] => file1.txt
)
[subfolder2] => Array
(
[0] => file1.txt
[1] => file2.txt
)
)
[0] => file1.txt
[1] => file2.txt
[2] => file3.txt
)
现在第二个数组是第一个数组的树（手动制作）。 =)
而且我不知道如何自动实现这一点。
简单示例（demo），它将像您希望的那样生成输出，但是如果在同一目录级别（演示）中具有相同的文件夹和文件名，则会遇到冲突。
$files = [
'folder1/file1.txt',
'folder1/file2.txt',
'file2.txt',
'folder2/file1.txt',
'folder1/subfolder1/file1.txt',
'folder1/subfolder2/file2.txt',
'file1.txt',
'file3.txt',
'folder1/subfolder2/file1.txt',
];
$tree = [];
foreach ($files as $file) {
$a = explode('/', $file);
$array = &$tree;
foreach (array_slice($a, 0, -1) as $folder) {
if (!isset($array[$folder])) $array[$folder] = [];
$array = &$array[$folder];
}
$array[] = end($a);
}
print_r($tree);
为了克服在同一级别上命名的相同文件夹和文件的问题，您可以创建末尾带有斜杠的文件夹索引，例如folder/，因此不会有任何冲突（演示）。