leetcode 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.

class Solution {
public:
    int climbStairs(int n) {
        int ways[n+1];
        if(n == 1) return 1;
        ways[n] = 1;
        ways[n-1] = 1;
        for(int i = n-2 ; i>=0 ; i--) ways[i] = ways[i+1] + ways[i+2];
        return ways[0];


    }
};

上面的解题方案的空间复杂度是 O(N) ，其中大部分空间都是浪费的。因为 n 的值至于 n - 1 和 n - 2 相关，其中 1 到 n - 3 的值不需要一直保存着。所以，本解题方案还可以继续优化：通过滚动数组的技巧将空间复杂度减少到O(1)。

class Solution {
public:
    int climbStairs(int n) {
        if(n<=2) return n;
        int num1 = 1;
        int num2 = 2;
        int res = 0;
        for(int i = 2 ; i<n ; i++){
            res = num1+num2;
            num1 = num2 ;
            num2 = res ;
        }
        return res;

    }
};