class Solution { public:int climbStairs(int n) {if (n == 1)return 1;int first = 1;int second = 2;for(int i = 3; i < n+1; i++){int third = first + second;first = second;second = third;}return second;} };

轉載于:https://www.cnblogs.com/smallredness/p/10675639.html

總結

以上是生活随笔為你收集整理的70.Climbing Stairs的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。