递归算法

package 递归算法.递归算法找所有文件;

import java.io.File;

public class Demo {
    public static void main(String[] args) {
        show("d:/");
    }
    public static void show(String path){
        File file=new File(path);
        File[] files = file.listFiles();
        if (files!=null) {
            for (File f1 :files ) {
                if (f1.isDirectory()) {
                    show(f1.getPath());
                } else {
                    System.out.println(f1.getPath()+f1.getName());
                }
            }
        }
    }
}

package 递归算法;

public class Demo {
    public static void main(String[] args) {
        int num=4;

        System.out.println( pulh(num));
    }
    public static long pulh(int num){
        if(num==1||num==0){
            return 1;
        }
        return num*pulh(num-1);
    }
}

package 递归算法;

public class Demo1 {
    public static void main(String[] args) {
        System.out.println(getnum(4));
    }
    public static long getnum(int num){
        if (num==1||num==0){
            return 1;
        }
        return num+getnum(num-1);
    }
}