122.买卖股票的最佳时机II
class Solution {
public:
int maxProfit(vector<int>& prices) {
int res =0;
for(int i=1; i<prices.size(); i++)
{
if(prices[i]-prices[i-1]>0) res+= prices[i]-prices[i-1];
}
return res;
}
};
55. 跳跃游戏
class Solution {
public:
bool canJump(vector<int>& nums) {
int max_step = nums[0];
for(int i=0; i<=max_step; i++)
{
if(i+nums[i]>=nums.size()-1) return true;
max_step = max(i+nums[i], max_step);
}
return false;
}
};
45.跳跃游戏II
class Solution {
public:
int jump(vector<int>& nums) {
if (nums.size() == 1) return 0;
int curDistance = 0;
int ans = 0;
int nextDistance = 0;
for (int i = 0; i < nums.size(); i++) {
nextDistance = max(nums[i] + i, nextDistance);
if (i == curDistance) {
ans++;
curDistance = nextDistance;
if (nextDistance >= nums.size() - 1) break;
}
}
return ans;
}
};