Day 32 贪心算法
122. 买卖股票的最佳时机II
优雅,实在是优雅
class Solution {
public:
int maxProfit(vector<int>& prices) {
int rst = 0;
for (int i = 1; i < prices.size(); ++i)
{
rst += max(prices[i] - prices[i - 1], 0);
}
return rst;
}
};
55. 跳跃游戏
class Solution {
public:
bool canJump(vector<int>& nums) {
if (nums.size() == 1) return true;
int cover = 0;
for (int i = 0; i <= cover; ++i)
{
cover = max(i + nums[i], cover);
if (cover >= nums.size() - 1) // 注意: 这里需要减1
{
return true;
}
}
return false;
}
};
45. 跳跃游戏II
class Solution {
public:
int jump(vector<int>& nums) {
if (nums.size() == 1) return 0;
int rst = 0;
int curCover = 0, nextCover = 0;
for (int i = 0; i < nums.size(); ++i)
{
nextCover = max(i + nums[i], nextCover);
if (i == curCover)
{
rst++;
curCover = nextCover;
if (nextCover == nums.size() - 1)
{
break;
}
}
}
return rst;
}
};