【C语言】滚动数组解爬楼梯一类问题

爬楼梯

力扣：力扣https://leetcode-cn.com/problems/climbing-stairs/

滚动数组：dp中的一个简单算法

int climbStairs(int n){
    int p = 0, q = 0, r = 1;
    for (int i = 1; i <= n; i++) {
        p = q;
        q = r;
        r = p + q;
    }
    return r;
}

就是从什么地方开始有规律，就从什么地方开始滚动

斐波那契数列

力扣：力扣https://leetcode-cn.com/problems/fibonacci-number/

int fib(int n){
    if(n==0){
        return 0;
    }else if(n==1){
        return 1;
    }else{
        int p = 0,q = 0, r = 1;
        for(int i = 2; i <= n; i++){
            p = q;
            q = r;
            r = p+q;
        }
        return r;
    }
}