java 列出子目录,列出Java中目录和子目录中的所有文件

What would be the fastest way to list the names of files from 1000+ directories and sub-directories?

EDIT;

The current code I use is:

import java.io.File;

public class DirectoryReader {

static int spc_count=-1;

static void Process(File aFile) {

spc_count++;

String spcs = "";

for (int i = 0; i < spc_count; i++)

spcs += " ";

if(aFile.isFile())

System.out.println(spcs + "[FILE] " + aFile.getName());

else if (aFile.isDirectory()) {

System.out.println(spcs + "[DIR] " + aFile.getName());

File[] listOfFiles = aFile.listFiles();

if(listOfFiles!=null) {

for (int i = 0; i < listOfFiles.length; i++)

Process(listOfFiles[i]);

} else {

System.out.println(spcs + " [ACCESS DENIED]");

}

}

spc_count--;

}

public static void main(String[] args) {

String nam = "D:/";

File aFile = new File(nam);

Process(aFile);

}

}

解决方案

This looks fine (Recursively going through the directory) The bottleneck will be all the file i/o you need to do, optimizing your Java will not show any real improvements.