[刷题]Climbing Stairs

[LintCode]Climbing Stairs

public class Solution {
    /**
     * @param n: An integer
     * @return: An integer
     */
    public int climbStairs(int n) {
        // 2015-05-14
        if (n == 0 || n == 1 || n == 2) {
            return n;
        }
        int[] sum = new int[n];
        sum[0] = 1;
        sum[1] = 2;
        for (int i = 2; i < n; i++) {
            sum[i] = sum[i - 1] + sum[i - 2];
        }
        return sum[n - 1];
    }
}