leetcode-algorithms/src/ClimbingStairs.java at master · anishLearnsToCode/leetcode-algorithms · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
public class ClimbingStairs {
    private static final int[] result = new int[50];

    static {
        result[0] = result[1] = 1;
        for (int index = 2 ; index < result.length ; index++) {
            result[index] = result[index - 1] + result[index - 2];
        }
    }

    public static int climbStairs(int steps) {
        return result[steps];
    }
}