题目1:【二刷完成】
class Solution {
public int findContentChildren(int[] g, int[] s) {
int result = 0;
Arrays.sort(g);
Arrays.sort(s);
int j=s.length-1;
for (int i=g.length-1; i>=0 ;i--){
if (j>=0 && s[j]>=g[i]){
result++;
j--;
}
}
return result;
}
}
题目2:【二刷完成】
class Solution {
public int wiggleMaxLength(int[] nums) {
int result=1; //这里必须是1开始
int prediff=0;
int curdiff=0;
if (nums.length<=1){
return nums.length;
}
for (int i=0;i<nums.length-1;i++){
curdiff = nums[i+1]-nums[i];
if (prediff>=0 && curdiff<0 || prediff<=0 && curdiff>0){
prediff = curdiff;
result++;
}
}
return result;
}
}
题目3:【二刷完成】
class Solution {
public int maxSubArray(int[] nums) {
int result = Integer.MIN_VALUE;
int count = 0;
for (int i=0;i<nums.length;i++){
count += nums[i];
if (count>result){
result = count;
}
if (count<=0){
count = 0;
}
}
return result;
}
}