代码随想录算法训练营第三十一天| 455.分发饼干、376. 摆动序列、53. 最大子序和
455.分发饼干
题目链接
文章讲解
class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
sort(g.begin(), g.end());
sort(s.begin(), s.end());
int i = 0, j = 0;
while (i < g.size() && j < s.size()) {
if (g[i] <= s[j]) i++;
j++;
}
return i;
}
};
376. 摆动序列
题目链接
文章讲解
class Solution {
public:
int wiggleMaxLength(vector<int>& nums) {
if (nums.size() == 1) return nums.size();
int prediff = 0;
int curdiff = 0;
int ans = 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)) {
ans++;
prediff = curdiff;
}
}
return ans;
}
};
53. 最大子序和
题目链接
文章讲解
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int ans = INT32_MIN;
vector<int> dp(nums.size());
dp[0] = nums[0];
for (int i = 0; i < nums.size(); i++) {
if (i > 0)
dp[i] = max(nums[i], dp[i - 1] + nums[i]);
ans = max(ans, dp[i]);
}
return ans;
}
};