首页 > 代码库 > climbing-stairs
climbing-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?
//斐波那契数列的非递归解法以及递归解法
class Solution { public: int climbStairs(int n) { if(n == 1) return 1; if(n == 2) return 2; int pre = 1; int current = 1; for(int i = 2; i <= n; i++){ int tmp = current+pre; pre = current; current = tmp; } return current; } int climbStairsRecursive(int n){ if(n == 1) return 1; if(n == 2) return 2; return climbStairsRecursive(n-1)+climbStairsRecursive(n-2); } };
climbing-stairs
声明:以上内容来自用户投稿及互联网公开渠道收集整理发布,本网站不拥有所有权,未作人工编辑处理,也不承担相关法律责任,若内容有误或涉及侵权可进行投诉: 投诉/举报 工作人员会在5个工作日内联系你,一经查实,本站将立刻删除涉嫌侵权内容。