题目
Assume you are an awesome parent and want to give your children some cookies. But, you should give each child at most one cookie. Each child i has a greed factor gi, which is the minimum size of a cookie that the child will be content with; and each cookie j has a size sj. If sj >= gi, we can assign the cookie j to the child i, and the child i will be content. Your goal is to maximize the number of your content children and output the maximum number.
Note:
You may assume the greed factor is always positive.
You cannot assign more than one cookie to one child.
题解:
int findContentChildren(vector<int>& g, vector<int>& s) {
sort(g.begin(),g.end());
sort(s.begin(),s.end());
int i=0,j=0,leng = g.size(),lens = s.size(),count=0;
while(i!=leng && j!=lens){
if(g[i]<=s[j]){
++count;
++i;
}
++j;
}
return count;
}
思路:
将饼大小和贪心值都排序一下,用目前最小的饼喂饱能喂饱的最不贪心的人