public class Solution {
public int JumpFloorII(int target) {
int[] array = new int[target+1];
array[0] = 1;
array[1] = 1;
for(int i = 2; i <= target; i++) {
for (int j = 1; j <= i; j++) {
array[i] += array[i-j];
}
}
return array[target];
}
}
变态跳台阶
最新推荐文章于 2017-06-09 18:09:37 发布