代码随想录算法训练营天 第八章 三十一天| 455.分发饼干 376. 摆动序列 53. 最大子序和
455.分发饼干
class Solution {
public int findContentChildren(int[] g, int[] s) {
Arrays.sort(g);
Arrays.sort(s);
int count = 0;
int j = 0;
for (int i = 0; i < g.length; i++) {
int gnum = g[i];
while (j < s.length && gnum > s[j] ) {
j++;
}
if (j < s.length && gnum <= s[j]) {
count++;
j++;
}
}
return count;
}
}
376. 摆动序列
class Solution {
public int wiggleMaxLength(int[] nums) {
if (nums.length <= 1) {
return nums.length;
}
int curDiff = 0;
int perDiff = 0;
int count = 1;
for (int i = 1; i < nums.length; i++) {
curDiff = nums[i] - nums[i-1];
if ((curDiff > 0 && perDiff <= 0) || (curDiff < 0 && perDiff >= 0)) {
count++;
perDiff = curDiff;
}
}
return count;
}
}
53. 最大子序和
class Solution {
public int maxSubArray(int[] nums) {
if (nums.length == 1) {
return nums[0];
}
int sum = Integer.MIN_VALUE;
int count = 0;
for (int i = 0; i < nums.length; i++) {
count += nums[i];
sum = Math.max(sum, count);
if (count < 0) {
count = 0;
}
}
return sum;
}
}