public class Solution {
public int jumpFloorII(int target) {
int[] dp = new int[target + 1];
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= target; i++) {
for (int j = 0; j < i; j++) {
dp[i] += dp[j];
}
}
return dp[target];
}
}
剑指offer-3.24-10.4-牛客
最新推荐文章于 2022-03-07 15:53:21 发布