class Solution {
public int maxProfit(int[] prices) {
int result = 0;
for(int i = 1; i < prices.length; i++){
result += Math.max(prices[i] - prices[i-1], 0);
}
return result;
}
}
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;
}
}