题目1:122. 买卖股票的最佳时机 II - 力扣(LeetCode)
贪心算法思路很简单,就是把每一天的利润都算出来,然后把整的加起来就是结果
class Solution {
public:
int maxProfit(vector<int>& prices) {
int result = 0;
for(int i = 0;i < prices.size() - 1;i++) {
if(prices[i + 1] - prices[i] > 0) {
result += prices[i + 1] - prices[i];
}
}
return result;
}
};
贪心算法的思路是根据每个元素看能覆盖的大小,然后更新,更新的时候要取大的覆盖,如果能够覆盖最后的元素就返回true
class Solution {
public:
bool canJump(vector<int>& nums) {
int cover = 0;
for(int i = 0;i <= cover;i++) {
cover = max(cover, i + nums[i]);
if(cover >= nums.size() - 1) return true;
}
return false;
}
};
题目3:45. 跳跃游戏 II - 力扣(LeetCode)
class Solution {
public:
int jump(vector<int>& nums) {
if(nums.size() == 1) return 0;
int reslut = 0;
int curcover = 0;
int nextcover = 0;
for(int i = 0;i < nums.size();i++) {
nextcover = max(nextcover, i + nums[i]);
if(i == curcover) {
reslut++;
curcover = nextcover;
if(curcover >= nums.size() - 1) break;
}
}
return reslut;
}
};