目录
局部最优 -> 全局最优(若找不出反例)即可用贪心
1. 分发饼干
class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
int res = 0;
sort(g.begin(), g.end());
sort(s.begin(), s.end());
for(int i=g.size()-1; i>=0; i--){
if(s.size() == 0 || g.size() == 0){
return res;
}
if(g[i] > s[s.size()-1]){
continue;
}
res++;
s.pop_back();
}
return res;
}
};
2. 摆动序列
class Solution {
public:
int wiggleMaxLength(vector<int>& nums) {
if (nums.size() == 1)
return 1;
int prediff = 0, curdiff = 0; // 记录前后坡度
int result = 1;
for (int i = 0; i < nums.size() - 1; i++) {
curdiff = nums[i + 1] - nums[i];
if (prediff >= 0 && curdiff < 0 || prediff <= 0 && curdiff > 0) {
result++;
prediff = curdiff;
cout << nums[i] << ' ';
}
}
return result;
}
};
3. 最大子数组和
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int result = INT_MIN;
int count = 0;
for (int i = 0; i < nums.size(); i++) {
count += nums[i];
if (result < count)
result = count;
if (count < 0)
count = 0;
}
return result;
}
};
/* 动态规划解法 */
class Solution {
public:
int maxSubArray(vector<int>& nums) {
vector<int> dp(nums.size(), 0); // dp[i]以nums[i]结尾的最大连续子序和
dp[0] = nums[0];
for(int i=1; i<nums.size(); i++){
if(dp[i-1] <= 0){
dp[i] = nums[i];
}else{
dp[i] = dp[i-1]+nums[i];
}
}
return *max_element(dp.begin(), dp.end());
}
};
4. 买卖股票最佳时机II
class Solution {
public:
int maxProfit(vector<int>& prices) {
if (prices.size() < 2) {
return 0;
}
int diff = 0;
int maxpro = 0;
for (int i = 0; i < prices.size() - 1; i++) {
diff = prices[i + 1] - prices[i];
if (diff < 0) {
continue;
} else {
maxpro += diff;
}
}
return maxpro;
}
};
5. 跳跃游戏
class Solution {
public:
bool canJump(vector<int>& nums) {
// 主要看覆盖范围,怎么跳并不重要
if (nums.size() == 1) {
return true;
}
int cover = nums[0];
for (int i = 1; i < nums.size(); i++) {
if (i <= cover && nums[i] + i > cover) {
cover = nums[i] + i;
}
}
if (cover >= nums.size() - 1) {
return true;
}
return false;
}
};
6. 跳跃游戏 II
class Solution {
public:
int jump(vector<int>& nums) {
if (nums.size() == 1) {
return 0;
}
int lessJump = 0;
int current = 0;
int next = 0;
for (int i = 0; i < nums.size(); i++) {
next = max(next, nums[i] + i);
if (i == current) {
lessJump++;
current = next;
if (current >= nums.size() - 1) {
break;
}
}
}
return lessJump;
}
};