class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
int result=0;
int index=s.size()-1;
sort(g.begin(),g.end());
sort(s.begin(),s.end());
for(int i=g.size()-1;i>=0;i--)
{
if(index>=0&&s[index]>=g[i])
{
result++;
index--;
}
}
return result;
}
};
pre=cur放在if外,第二十九个用例过不了
class Solution {
public:
int wiggleMaxLength(vector<int>& nums) {
if(nums.size()<=1)return nums.size();
int pre=0;
int cur=0;
int result=1;
for(int i=0;i<nums.size()-1;i++)
{
cur=nums[i+1]-nums[i];
if((pre>=0&&cur<0)||(pre<=0&&cur>0))
{
result++;
pre=cur;
}
//pre=cur;
}
return result;
}
};
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int sum=0;
int result=INT_MIN;
for(int i=0;i<nums.size();i++)
{
sum+=nums[i];
result=max(result,sum);
if(sum<0)
{
sum=0;
}
}
return result;
}
};