递归运算就是方法调用自身,递归必须有出口
读取相应路径下的文件的文件名
code:
public static void fun(String dirName){
File file = new File(dirName);
File[] files = file.listFiles();
for (int i = 0; i < files.length; i++) {
File tempFile = files[i];
if (tempFile.isDirectory()) {
fun(tempFile.getPath());
}else {
System.out.println(tempFile.getName());
}
}
}
又例如:
裴波那契数列:1,1,2,3,5,8,13,21,34......
public static int fun(int i){
if(i==1||i==2){
return 1;
}else{
return fun(i-1)+fun(i-2);
}
}