Leetcode#70 Climbing Stairs

原题地址

基本动归题

可以压缩状态空间

代码：

int climbStairs(int n) {
        if (n <= 0)
            return 0;
            
        int count = 1;
        int tmp = 1;
        
        for (int i = 2; i <= n; i++) {
            int t = count;
            count += tmp;
            tmp = t;
        }
        
        return count;
}