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