题目链接:122. 买卖股票的最佳时机 II - 力扣(Leetcode)
class Solution {
public:
int maxProfit(vector<int>& prices) {
int sum = 0;
for(vector<int>::size_type 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) {
vector<int>::size_type cover = 0;
for(vector<int>::size_type i = 0; i <= cover; i++) {
cover = cover > (i + nums[i])? cover : i + nums[i];
if (cover >= nums.size() - 1) return true;
}
return false;
}
};
题目链接:45. 跳跃游戏 II - 力扣(Leetcode)
class Solution {
public:
int jump(vector<int>& nums) {
vector<int>::size_type cover = 0;
int step = 0;
for(vector<int>::size_type i = 0; i <= cover; ++i) {
if(cover >= nums.size() - 1) return step;
if(i + nums[i] > cover) {
cover = i + nums[i];
++step;
}
}
return -1;
}
};