斐波那契式的动态规划:
- target从0开始
适用于f(0) = 0, f(1) = 1
public int JumpFloor(int target) {
int g = 1,f = 0;
while (target --) {
g = f + g;
f = g - f;
}
return f;
}
- target从1开始
适用于 f(1) = 1, f(2) = 2;
public int JumpFloor(int target) {
int g = 2,f = 1;
while (target > 1) {
g = f + g;
f = g - f;
target--;
}
return f;
}
以上两个区别:一个是跳出while循环的时候的target大小;一个是g和f的初始值