455.分发饼干
题目链接
我的题解
class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
sort(g.begin(), g.end());
sort(s.begin(), s.end());
int res = 0;
int i = 0;
for (const auto& cookie : s) {
if (cookie >= g[i]) {
res ++;
i ++;
if (i == g.size()) break;
}
}
return res;
}
};
376. 摆动序列
题目链接
我的题解
class Solution {
public:
int wiggleMaxLength(vector<int>& nums) {
int diff = 0;
int res = 1;
for (int i = 1; i < nums.size(); i ++) {
int tmp = nums[i] - nums[i - 1];
if ((tmp > 0 && diff < 0) || (tmp < 0 && diff > 0) || (diff == 0 && tmp != 0)) res ++;
if (tmp == 0) continue;
diff = tmp;
}
return res;
}
};
53. 最大子序和
题目链接
我的题解
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int sum = 0;
int max_sum = nums[0];
for (int num : nums) {
sum += num;
max_sum = max(max_sum, sum);
if (sum < 0) sum = 0;
}
return max_sum;
}
};