70. Climbing Stairs

You are climbing a stair case. It takes n steps to reach to the top.

Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top?

Note: Given n will be a positive integer.

Solution:

Tips:

recursion will exceed time limit. so change to iterate.

Java Code:

public class Solution {
    public int climbStairs(int n) {
        if (n <= 1) {
            return 1;
        }
        
        if (n == 2) {
            return 2;
        }
        int num1 = 1;
        int num2 = 2;
        int result = num1 + num2;
        for (int i = 2; i < n; i++) {
            result = num1 + num2;
            num1 = num2;
            num2 = result;
        }
        
        return result;
    }
}