455. 分发饼干
class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
sort(g.begin(),g.end());
sort(s.begin(),s.end());
int index=s.size()-1;
int result=0;
for(int i=g.size()-1;i>=0;i--){
if(index>=0&&s[index]>=g[i]){
index--;
result++;
}
}
return result;
}
};
376. 摆动序列
class Solution {
public:
int wiggleMaxLength(vector<int>& nums) {
if(nums.size()<1) return nums.size();
int curDiff=0;
int preDiff=0;
int result=1;
for(int i=1;i<nums.size();i++){
curDiff=nums[i]-nums[i-1];
if(preDiff>=0&&curDiff<0||preDiff<=0&&curDiff>0){
result++;
preDiff=curDiff;
}
}
return result;
}
};
53. 最大子数组和
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int result=INT32_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;
}
};