class Solution {
    public int climbStairs(int n) {
        if (n < 0) return 0;

        int a = 1;
        int b = 1;
        int t;

        for (int i = 1; i < n; i++) {
            t = b;
            b += a;
            a = t;
        }

        return b;
    }
}