122.买卖股票的最佳时机II
class Solution {
public int maxProfit(int[] prices) {
int profit = 0;
for (int i = 1; i < prices.length; i++) {
profit += Math.max(prices[i] - prices[i - 1], 0);
}
return profit;
}
}
55. 跳跃游戏
class Solution {
public boolean canJump(int[] nums) {
int cover = 0;
for (int i = 0; i <= cover; i++) {
cover = Math.max(i + nums[i], cover);
if (cover >= nums.length - 1) {
return true;
}
}
return false;
}
}
45.跳跃游戏II
class Solution {
public int jump(int[] nums) {
if (nums.length == 1) return 0;
int ans = 0;
int cur = 0, next = 0;
for (int i = 0; i < nums.length; i++) {
next = Math.max(i + nums[i], next);
if (cur == i && cur < nums.length) {
ans++;
cur = next;
}
if (cur >= nums.length - 1) {
break;
}
}
return ans;
}
}