T70 爬楼梯

桌桌 2022-8-12 206 8/12

题目描述：

T70 爬楼梯

解题思路：

对于每个楼梯状态，我只需要知道之前的一个和之前两个楼梯有多少种方法然后将他们加起来就可以了

代码如下：

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

结果如下：

T70 爬楼梯

- THE END -

桌桌

8月16日01:08

最后修改：2022年8月16日

非特殊说明，本博所有文章均为博主原创。

如若转载，请注明出处：https://wangyuanzhuo.top/t70-%e7%88%ac%e6%a5%bc%e6%a2%af/

T83 删除排序链表中的重复元素

T21 合并两个有序链表

共有 7 条评论

bitcoin
Hiya very nice site!! Man .. Beautiful .. Wonderful .. Theron Martini

2022-09-04 23:36 Chrome 86.0.4240.193 Windows 10/11 回复
bitcoin
I have read so many posts about the blogger lovers but this article is in fact a good article, keep it up. Pablo Wrightsman

2022-09-06 20:41 Chrome 86.0.4240.193 Windows 10/11 回复
king putin
These are genuinely great ideas in concerning blogging. Mose Husseini

2022-09-06 23:10 Chrome 86.0.4240.193 Windows 10/11 回复
king putin
Looking forward to reading more. Great blog article. Much obliged. Sam Belcourt

2022-09-07 00:17 Chrome 86.0.4240.193 Windows 10/11 回复
Loveme
One can learn something new here everyday. Im a regular for most of those blogs, but still didnt know about a couple of them. Faustino Nein

2022-09-07 03:26 Chrome 86.0.4240.193 Windows 10/11 回复
Anna94 wants to trade nude pics with you
I truly appreciate this post. Well, I have put together a long list. Interesting content. I truly appreciate this post. Dustin Carathers

2022-09-07 07:20 Chrome 86.0.4240.193 Windows 10/11 回复
sikis
Very interestting details you have mentioned, appreciate it for putting up. Darrell Soboleski

2022-09-08 03:32 Chrome 86.0.4240.193 Windows 10/11 回复