提示：文章写完后，目录可以自动生成，如何生成可参考右边的帮助文档

前言

一、力扣122. 买卖股票的最佳时机 II

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

二、力扣55. 跳跃游戏

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

三、力扣45. 跳跃游戏 II

class Solution {public int jump(int[] nums) {int result = 0;// 当前覆盖的最远距离下标int end = 0;// 下一步覆盖的最远距离下标int temp = 0;for (int i = 0; i <= end && end < nums.length - 1; ++i) {temp = Math.max(temp, i + nums[i]);// 可达位置的改变次数就是跳跃次数if (i == end) {end = temp;result++;}}return result;}
}