122. 买卖股票的最佳时机 II - 力扣（LeetCode）

class Solution {public int maxProfit(int[] prices) {int max = 0;for (int i = 1; i < prices.length; i++){int profit = prices[i] - prices[i - 1];if (profit > 0) {max += profit;}}return max;}
}

55. 跳跃游戏 - 力扣（LeetCode）

class Solution {public boolean canJump(int[] nums) {if (nums.length <= 1) return true;int cover = 0;for (int i = 0; i <= cover; i++) {cover = Math.max(cover, i + nums[i]);if (cover >= nums.length - 1) return true;}return false;}
}

45. 跳跃游戏 II - 力扣（LeetCode）

class Solution {public int jump(int[] nums) {int res = 0;int cur = 0;int next = 0;for (int i = 0; i < nums.length - 1; i++) {next = Math.max(next, i + nums[i]);if (i == cur) {cur = next;res++;}}return res;}
}