剑指offer题解 变态跳台阶

public class Solution {
public int JumpFloorII(int target) {
if(target==0) return 0;
else if(target==1) return 1;
int[] result=new int[target+1];
result[0]=1;
result[1]=1;
for(int i=2;i<result.length;i++){
for(int j=0;j<i;j++){
result[i]+=result[j];
}

}
return result[target];
}
}