遍历文件夹

import java.io.File;
import java.util.ArrayList;
import java.util.concurrent.LinkedBlockingQueue;

/**
 * 遍历文件夹
 */
public class TraversalFolder {

    /**
     * 深度优先遍历文件夹
     * <p>
     * 要点：使用递归的方式来实现。
     *
     * @param topFile
     * @param orderedList
     */
    public static void depthFirstSearch(File topFile, ArrayList<File> orderedList) {

        if (null != topFile) {
            if (topFile.isDirectory()) {
                File[] files = topFile.listFiles();
                for (File file : files) {
                    if (file.isDirectory()) {
                        depthFirstSearch(file, orderedList);
                    } else {
                        orderedList.add(file);
                    }
                }
            } else {
                orderedList.add(topFile);
            }
        }
    }

    /**
     * 广度优先遍历文件夹
     * <p>
     * 要点：利用栈的先进后出的特点来实现。
     *
     * @param topFile
     * @param orderedList
     * @param maxNum
     */
    public static void breadthFirstSearch(File topFile, ArrayList<File> orderedList, int maxNum) {

        if (null != topFile) {

            LinkedBlockingQueue<File> queue = new LinkedBlockingQueue<File>(maxNum);
            queue.offer(topFile);

            while (!queue.isEmpty()) {

                File file = queue.poll();
                if (file.isDirectory()) {
                    File[] files = file.listFiles();
                    for (File f : files) {
                        if (f.isDirectory()) {
                            queue.offer(f);
                        } else {
                            orderedList.add(f);
                        }
                    }
                } else {
                    orderedList.add(file);
                }
            }
        }
    }


    public static void main(String[] args) {

        String path = "C:\\Users\\jxn\\Desktop\\新建文件夹(3)";
        File topFile = new File(path);

        ArrayList<File> orderedList = new ArrayList<>();

//        depthFirstSearch(topFile,orderedList);
        breadthFirstSearch(topFile, orderedList, 100);

        orderedList.stream().forEach((x) -> {
            System.out.println(x.getAbsoluteFile());
        });

    }
}