122.买卖股票的最佳时机II
只收割正利润的那一天。
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;
}
};
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(i + nums[i], cover);
if (cover >= nums.size() - 1) return true;
}
return false;
}
};
45.跳跃游戏II
在每一步可达到的范围内寻找下一步可达到的最大覆盖范围,以此求得最小的步数。
class Solution {
public:
int jump(vector<int>& nums) {
if (nums.size() == 1) return 0;
int curDistance = 0;
int ans = 0;
int nextDistance = 0;
for (int i = 0; i < nums.size(); i++) {
nextDistance = max(nums[i] + i, nextDistance);
if (i == curDistance) {
if (curDistance < nums.size() - 1) {
ans++;
curDistance = nextDistance;
if (nextDistance >= nums.size() - 1) break;
} else break;
}
}
return ans;
}
};