大厂面试--递归与迭代

package com.main.xxx;

public class TestStep {
    public static void main(String[] args) {
        TestStep testStep = new TestStep();
        //获取当前系统时间
        long start = System.currentTimeMillis();
        System.out.println(testStep.f(40));//165580141
        long end = System.currentTimeMillis();
        System.out.println(end-start);//359
    }
    //实现f(n):求n步台阶，一共有几种走法
    public int f(int n){
        if (n<1){
            throw new IllegalArgumentException(n + "甭能小于一");
        }
        if (n == 1 || n == 2){
            return n;
        }
        return f(n-2) + f(n-1);
    }
}

package com.main.xxx;

public class TestStep2 {
    public static void main(String[] args) {
        TestStep2 testStep2 = new TestStep2();
        long start = System.currentTimeMillis();
        System.out.println(testStep2.loop(40));//165580141
        long end = System.currentTimeMillis();
        System.out.println(end - start);//<1ms
    }
    public int loop(int n){
        if (n<1){
            throw new IllegalArgumentException(n + "甭能小于一");
        }
        if (n == 1 || n == 2){
            return n;
        }

        int one = 2;//初始化为走到第二季台阶的走法
        int two = 1;//初始化为走到第一级台阶的走法
        int sum = 0;

        for (int i = 3; i <= n; i++) {
            //最后跨2步 + 最后跨1步的走法
            sum = two + one;
            two = one;
            one = sum;
        }
        return sum;
    }
}