[LeetCode] 70. Climbing Stairs

题：https://leetcode.com/problems/climbing-stairs/description/

题目

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.

Example 1:
Input: 2
Output: 2
Explanation: There are two ways to climb to the top.
1. 1 step + 1 step
2. 2 steps

Example 2:
Input: 3
Output: 3
Explanation: There are three ways to climb to the top.
1. 1 step + 1 step + 1 step
2. 1 step + 2 steps
3. 2 steps + 1 step

思路

动态规划，DAG的路径，整体最大包含局部最大，在这道题上都有展现。
设dp(n)为 到n的最大中路线。
则状态转移方程为dp(n) = dp(n-1) + dp(n-2)

Code

class Solution {
public:
    int dp(int i ,int a[]){
        if(a[i] != -1)  return a[i];
        return a[i] = dp(i-1,a) + dp(i-2,a);
    }
    int climbStairs(int n) {
        if(n<=2)    return n;
        int a[n+1];
        for(int i = 0;i<=n;i++)
            a[i] = -1;
        a[1] = 1;
        a[2] = 2;
        return dp(n,a);  
    }
};