Climbing Stairs (Java)

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Source

public class Solution {
    public int climbStairs(int n) {
        int once = 1, twice = 2, total = 0;  //f(1)的走法有1种 f(2)的走法有两种
        if(n <= 2) return n;
        
        for(int i = 0 ; i < n - 2 ;i++){
        	total = once + twice;	//f(3)=f(1)+f(2) f(n)=f(n-1)+f(n-2) 登上第n个台阶的走法有f(n-1)+f(n-2)组成 f(n-1)是所有最后一次走一步的走法 f(n-2)是所有最后走两步的走法
        	once = twice;   //f(5)=f(4)+f(3) f(4)=f(3)+f(2) 要把当前之前的两个相加 所以要更新once和twice的值
        	twice = total;
        	
        }
        return total;
    }
}

Test

 public static void main(String[] args){
    int n = 22;
    System.out.println(new Solution().climbStairs(n));
 }