贪心算法
class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
if(s.size()== 0 || g.size() == 0)
return 0;
int child = 0;
int sugar = 0;
sort(g.begin(),g.end());
sort(s.begin(),s.end());
while(child < g.size() && sugar<s.size())
{
if(g[child]<=s[sugar])
{
child++;
sugar++;
}else{
sugar++;
}
}
return child;
}
};