来自:https://www.nowcoder.com/questionTerminal/8c82a5b80378478f9484d87d1c5f12a4?answerType=1&f=discussion
方法一:
面试别写型递推版实现,时间复杂度 O(2^n)。
public class Solution {
public int JumpFloor(int n) {
if (n == 1) return 1;
if (n == 2) return 2;
return JumpFloor(n - 1) + JumpFloor(n - 2);
}
}
方法二:
面试推荐型,自底向上型循环求解,时间复杂度为 O(n)。
public class Solution {
public int JumpFloor(int target) {
int a = 1, b = 1;
for (int i = 1; i < target; i++) {
a = a + b;
b = a - b;
}
return a;
}
}
方法三:我写的。
class Solution {
public int climbStairs(int n) {
if (n == 0 || n == 1) {
return n;
}
int[] dp = new int[n + 1];
dp[0] = 0;
dp[1] = 1;
dp[2] = 2;
for (int i = 3; i <= n; i++) {
dp[i] = dp[i - 1] + dp[i - 2];
}
return dp[n];
}
}
public class Main {
public static void main(String args[]) {
int k = 0;
Solution p = new Solution();
int res = p.climbStairs(k);
System.out.println("结果" + res);
}
}