递归算法的关键是如何处理当前层的数据,以及何时退出,想明白这两点,代码就好写了
package workFiles;
import java.util.LinkedList;
/**
* 模拟文件类,包括文件夹和文件
*/
public class File {
private LinkedList<File> folders;
private LinkedList<String> files;
public LinkedList<File> getFolders() {
return folders;
}
public void setFolders(LinkedList<File> folders) {
this.folders = folders;
}
public LinkedList<String> getFiles() {
return files;
}
public void setFiles(LinkedList<String> files) {
this.files = files;
}
}
package workFiles;
import java.util.LinkedList;
public class WalkTree {
public static void main(String[] a){
LinkedList<File> list = new LinkedList<>();
File f = createTree();
list.add(f);
while(list.size()!=0){
readList(list);
}
}
static LinkedList<File> readList(LinkedList<File> list){
File f = list.removeLast();
if(f.getFolders()!=null&&f.getFolders().size()!=0){
File next = f.getFolders().removeLast();
list.add(f);
list.add(next);
}
else{
if(f.getFiles()!=null&&f.getFiles().size()!=0){
for(int i=0;i<f.getFiles().size();i++){
System.out.println(f.getFiles().get(i));
}
}
}
return list;
}
static File createTree(){
File A =new File();
File B =new File();
File C =new File();
LinkedList<String> str1 = new LinkedList<String>();
str1.add("A文件1");
A.setFiles(str1);
LinkedList<String> str2 = new LinkedList<String>();
str2.add("B文件1");
str2.add("B文件2");
B.setFiles(str2);
LinkedList<String> str3 = new LinkedList<String>();
str3.add("C文件1");
str3.add("C文件2");
str3.add("C文件3");
C.setFiles(str3);
LinkedList<File> temp = new LinkedList<File>();
temp.add(B);
temp.add(C);
A.setFolders(temp);
return A;
}
}