测试对比File类递归与SimpleFileVisitor类遍历文件夹的耗时:
package other;
import java.io.File;
import java.io.IOException;
import java.nio.file.FileVisitResult;
import java.nio.file.Files;
import java.nio.file.Path;
import java.nio.file.Paths;
import java.nio.file.SimpleFileVisitor;
import java.nio.file.attribute.BasicFileAttributes;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
public class FilterMp3 {
private List<File> musicList = new ArrayList<>();
private List<File> musicList2 = new ArrayList<>();
private long fLen = 1024*1024*3;
private String filterD = "D:/";
//遍历方法1:
public List<File> getLocalMp3(){
File[] rootDirectory = new File(filterD).listFiles();
long start = System.currentTimeMillis();
System.out.println("开始递归" + start);
nextDirectory(rootDirectory);
long end = System.currentTimeMillis();
System.out.p