Leetcode: Climbing stairs

寻找斐波那契序列中的元素：递归、动态规划与迭代解决方案

最新推荐文章于 2020-06-13 21:54:39 发布

原创最新推荐文章于 2020-06-13 21:54:39 发布 · 200 阅读

0 ·

CC 4.0 BY-SA版权

//looking for nth element in a fibonacci-like sequence
//solution include recursion, dp and iteration.
class Solution {
public:
    int climbStairs(int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int s0=1;
        int s1=1;
        //int temp;
        while(--n>0){
            int temp=s0+s1;
            s0=s1;
            s1=temp;
        }
        return s1;
    }
};