代码随想录算法打卡第二十八天, 新手自我记录一下刷题历程, 仅为自我打卡使用.
贪心好难!
class Solution {
public:
int maxProfit(vector<int>& prices) {
int result = 0;
for (int i = 1; i < prices.size(); ++i) {
result += max(prices[i] - prices[i - 1], 0);
}
return result;
}
};
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;
}
};
class Solution {
public:
int jump(vector<int>& nums) {
int count = 0;
int cover = 0;
int maxCover = 0;
for (int i = 0; i <= cover; ++i) {
if (cover >= nums.size() - 1) {
break;
}
maxCover = max(nums[i] + i, maxCover);
if (i == cover) {
cover = maxCover;
count++;
}
}
return count;
}
};
今天打了两张卡, 希望还能再坚持一天!