455.分发饼干
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:贪心算法,你想先喂哪个小孩?| LeetCode:455.分发饼干_哔哩哔哩_bilibili
状态:未通过
代码实现:
class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
sort(g.begin(), g.end());
sort(s.begin(), s.end());
int result = 0;
int index = s.size() - 1;
for(int i = g.size() - 1; i >= 0; i--){
if(index >= 0 && s[index] >= g[i]){
result++;
index--;
}
}
return result;
}
};
376. 摆动序列
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:贪心算法,寻找摆动有细节!| LeetCode:376.摆动序列_哔哩哔哩_bilibili
状态:未通过
代码实现:
class Solution {
public:
int wiggleMaxLength(vector<int>& nums) {
if(nums.size() <= 1) return nums.size();
int preDiff = 0;
int curDiff;
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 += 1;
preDiff = curDiff;
}
}
return result;
}
};
53. 最大子序和
题目链接:. - 力扣(LeetCode)
文档讲解:代码随想录
视频讲解:贪心算法的巧妙需要慢慢体会!LeetCode:53. 最大子序和_哔哩哔哩_bilibili
状态:未通过
代码实现:
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(count > result){
result = count;
}
if(count < 0){
count = 0;
}
}
return result;
}
};