package algorithm;
import java.io.File;
public class Recursion {
//递归求阶乘
private static long recursion(int n){
if(n == 1){
return 1;
}
return n * recursion(n - 1);
}
//递归找出文件夹下的所有文件
private static void fileRecursion(File file){
File[] files = file.listFiles();
for(int i = 0;i < files.length;i ++){
if(files[i].isDirectory()){
fileRecursion(files[i]);
}
System.out.println(files[i].getName());
}
}
public static void main(String[] args) {
long result = recursion(1000);
System.out.println(result);
File file = new File("D:\\feiq");
fileRecursion(file);
}
}