70. Climbing Stairs

问题

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?

Note: Given n will be a positive integer.

Example 1:

Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example 2:

Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step

分析

1 问题归属于动态规划，是一个斐波那契数列

2 递归的思路行不通，耗时太多了。

3 a = 1 ,b = 1, b = a + b, a = b - a; nice的一种写法，不过可读性不是很高 2 ， 3， 5 

代码

public int climbStairs(int n) {
        if(n == 1) return  1;
        if(n == 2) return  2;
        int i = 1;
        int j = 2;
        int k = 3;
        while(k <= n){
            int temp = j;
            j += i;
            i = temp;
            k++;
        }
        return j;
        
        int a = 1, b = 1;
        while (n-- > 0){
            b = a + b; //forward b in Fibonacci chain: b_cur(5) = a_pre(2) + b_pre(3)
            a = b - a; //forward a in Fibonacci chain: a_cur(3) = b_cur(5) - a_pre(2)
            //a = (b += a) - a; //write in one line
        }
        return a;
        // return climbStairs(n - 1) + climbStairs(n - 2);   
    }