122. 买卖股票的最佳时机 II - 力扣(Leetcode)
class Solution {
public:
int maxProfit(vector<int>& prices) {
int sum=0;
for(int i=0;i<prices.size()-1;i++)
{
if(prices[i+1]-prices[i]>0)
sum+=(prices[i+1]-prices[i]);
}
return sum;
}
};
class Solution {
public:
bool canJump(vector<int>& nums) {
int cover=0;
for(int i=0;i<=cover;i++)
{
cover=max(cover,nums[i]+i);
if(cover>=nums.size()-1)
return true;
}
return false;
}
};
class Solution {
public:
int jump(vector<int>& nums) {
int cur=0;
int next=0;
int step=0;
for(int i=0;i<nums.size();i++)
{
next=max(nums[i]+i,next);
if(i==cur)
{
if(cur<nums.size()-1)//cur<nums.size()-1
{
step++;
cur=next;
if(next>=nums.size()-1)//下一跳能跳到
break;
}
else//cur=nums.size()-1
{
break;
}
}
}
return step;
}
};