70. Climbing Stairs (Array; DP)

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?

class Solution {
public:
    int climbStairs(int n) {
        int result[n+];
        result[] = ;
        result[] = ;
        int i =;
        while(i<=n)
        {
            result[i] = result[i-]+result[i-];
            i++;
        }
        return result[n];
    }
};