Участник:Dancho O/Climbing stairs

Ссылки сюда (2) →

https://leetcode.com/problems/climbing-stairs/

class Solution {
    public int climbStairs(int n) {
        int prev = 1;
        int cur = 1;
        int next = 0;
        for(int i = 1; i < n; i++) {
            next = prev + cur;
            prev = cur;
            cur = next;
        }
        return cur;
    }
}