LeetCode OJ平台上的Climbing Stairs题目用java迭代解决

题目如下。

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?

谢谢木易先森的点拨，f(n)表示爬n个台阶的方法数，f(n) = f(n-1) + f(n-2)；

f(1) = 1;

f(2) =2;

以此迭代即可。

public class Solution {public int climbStairs(int n) {int s1 = 1;int s2 = 2;int result = 0;if(n < 1)return 0;else if(n < 2)return 1;else if(n < 3)return 2;else{for(int i = 0; i < n - 2; i ++){result = s1 + s2;s1 = s2;s2 = result;              }}return result;}
}

LeetCode OJ平台上的Climbing Stairs题目用java迭代解决相关推荐

LeetCode OJ平台上Maximum Subarray题目O(n)复杂度解决方式
原始题目例如以下,意为寻找数组和最大的子串,返回这个最大和就可以. Find the contiguous subarray within an array (containing at least ...
LeetCode OJ平台上Maximum Subarray题目O(n)复杂度解决方案
原始题目如下,意为寻找数组和最大的子串,返回这个最大和即可. Find the contiguous subarray within an array (containing at least one ...
leetcode python3 简单题70. Climbing Stairs
1.编辑器我使用的是win10+vscode+leetcode+python3 环境配置参见我的博客: 链接 2.第七十题 (1)题目英文: You are climbing a stair ca ...
Leetcode平台上的Median of Two Sorted Arrays题目用Java快排实现
Leetcode平台上的Median of Two Sorted Arrays题目,大意就是找两个已排序数组的中位数.今天先用快排的方式实现一下,代码如下: There are two sorted ...
[LeetCode]70.Climbing Stairs
[题目] You are climbing a stair case. It takes n steps to reach to the top. Each time you can either c ...
【斐波那切数列】LeetCode 70. Climbing Stairs
LeetCode 70. Climbing Stairs 这是一道利用斐波那切数列求解的题目.求斐波那切数列有比较经典的4种方法 (1)递归法:复杂度太高 (2)迭代法:时间复杂度为O(n)O(n)O ...
【动态规划斐波那切数列】LeetCode 746. Min Cost Climbing Stairs
LeetCode 746. Min Cost Climbing Stairs 本博客转载自:http://www.cnblogs.com/grandyang/p/8343874.html 存在无代价的 ...
[勇者闯LeetCode] 70. Climbing Stairs
[勇者闯LeetCode] 70. Climbing Stairs Description You are climbing a stair case. It takes n steps to rea ...
LeetCode 746. Min Cost Climbing Stairs--动态规划--Java,C++,Python解法
题目地址:Min Cost Climbing Stairs - LeetCode LeetCode 动态规划(Dynamic programming)系列题目:LeetCode 动态规划(Dynami ...

LeetCode OJ平台上的Climbing Stairs题目用java迭代解决

LeetCode OJ平台上的Climbing Stairs题目用java迭代解决相关推荐

最新文章

热门文章