Python3解leetcode Maximum SubarrayClimbing Stairs

問題：

 

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

思路：
上臺階問題，一次只能上一個或兩個臺階，問總共有n個臺階，一共有多少種走法。
明顯的動態規劃問題，
當要到達地n個臺階的時候，有兩種走法，第一種是從N-1個臺階走一步，第二種是N-2個臺階走兩步。

class Solution:
    def climbStairs(self, n: int) -> int:
        if n ==1 :return 1
        count= [0 for i in range(n)]
        count[0] = 1
        count[1] = 2
        for i in range(2,n):
            count[i] = count [i-1] + count[i-2]
        return count[n-1]