注:此博客不再更新,所有最新文章将发表在个人独立博客limengting.site。分享技术,记录生活,欢迎大家关注
斐波那契数列
题目描述
大家都知道斐波那契数列:f(0) = 0, f(1) = 1, f(n) = f(n - 1) + f(n - 2)
现在要求输入一个整数n,请你输出斐波那契数列的第n项。
n<=39
**思路:**如果直接用f(n) = f(n - 1) + f(n - 2)递归,重复计算次数太多,效率低下;用自下而上的循环较好,通过f(0)和f(1)算出f(2),再根据已知的f(1)和f(2)算出f(3)…时间复杂度为O(n)
public class Solution {
public int Fibonacci(int n) {
int former = 0, latter = 1;
if (n == 0) return 0;
if (n == 1) return 1;
for (int i = 2; i <= n; i ++) {
latter += former;
former = latter - former;
}
return latter;
}
}
运行时间:18ms
占用内存:10276k
斐波那契数列的O(logn)解法思路:
跳台阶
题目描述
一只青蛙一次可以跳上1级台阶,也可以跳上2级。求该青蛙跳上一个n级的台阶总共有多少种跳法。
思路: f(1) = 1, f(2) = 2, f(n) = f(n - 1) + f(n - 2)
public class Solution {
public int JumpFloor(int target) {
int former = 1, latter = 2;
if (target == 0) return -1;
if (target == 1) return 1;
if (target == 2) return 2;
for (int i = 3; i <= target; i ++) {
latter += former;
former = latter - former;
}
return latter;
}
}
运行时间:21ms
占用内存:8684k
变态跳台阶
题目描述
一只青蛙一次可以跳上1级台阶,也可以跳上2级……它也可以跳上n级。求该青蛙跳上一个n级的台阶总共有多少种跳法。
思路:
因为n级台阶,第一步有n种跳法:跳1级、跳2级、到跳n级
跳1级,剩下n-1级,则剩下跳法是f(n-1)
跳2级,剩下n-2级,则剩下跳法是f(n-2)
所以f(n) = f(n-1) + f(n-2) + … + f(1)
因为f(n-1) = f(n-2) + f(n-3) + … + f(1)
所以f(n) = 2 * f(n-1)
再递推可以得到f(n) = 2 ^ (n - 1)
递归:
public class Solution {
public int JumpFloorII(int target) {
if (target <= 0) return -1;
if (target == 1) return 1;
return 2 * JumpFloorII(target - 1);
}
}
运行时间:18ms
占用内存:8688k
自下而上的循环:
public class Solution {
public int JumpFloorII(int target) {
if (target <= 0) return -1;
int result = 1;
if (target == 1) return 1;
for (int i = 2; i <= target; i ++) {
result *= 2;
}
return result;
}
}
运行时间:16ms
占用内存:11096k
用移位代替乘2:
public class Solution {
public int JumpFloorII(int target) {
if (target <= 0) return -1;
int result = 1;
if (target == 1) return 1;
return result << --target;
}
}
运行时间:11ms
占用内存:9288k
再去掉不必要的代码:
public class Solution {
public int JumpFloorII(int target) {
if (target <= 0) return -1;
return 1 << --target;
}
}
运行时间:18ms
占用内存:9268k
矩形覆盖
题目描述
我们可以用21的小矩形横着或者竖着去覆盖更大的矩形。请问用n个21的小矩形无重叠地覆盖一个2*n的大矩形,总共有多少种方法?
public class Solution {
public int RectCover(int target) {
if (target <= 0) return 0;
if (target == 1) return 1;
if (target == 2) return 2;
int former = 1, latter = 2;
for (int i = 3; i <= target; i ++) {
latter += former;
former = latter - former;
}
return latter;
}
}
运行时间:24ms
占用内存:9372k