70. Climbing Stairs(E, 跳台阶)

class Solution { public int climbStairs(int n) { int[] dp = new int[n]; dp[0] = 1; if(n > 1) dp[1] = 2; for (int i = 2; i<n; i++){ dp[i] = dp[i-1]+dp[i-

>>阅读原文<<