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.
Example 1:
Input: [1,2,3], [1,1] Output: 1 Explanation: You have 3 children and 2 cookies. The greed factors of 3 children are 1, 2, 3. And even though you have 2 cookies, since their size is both 1, you could only make the child whose greed factor is 1 content. You need to output 1.
分析:
按照题意,给两个数组g和s,g中存放的元素是每个学生的贪婪程度,s中存放的是饼干大小,若sj >= gi,则认为学生对此满意,每个人最多只能有一块饼干,要求能使学生满意的最大人数。可以对两个数组从小到大排序,优先满足贪婪度小的学生,直到饼干发完为止。
class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
sort(g.begin() , g.end());
sort(s.begin() , s.end());
int len1 = g.size();
int len2 = s.size();
int res = 0;
int i = 0;
int j = 0;
while(i <= len1-1 && j <= len2-1)
{
if(s[j] >= g[i])
{
res++;
j++;
i++;
}
else
{
j++;
}
}
return res;
}
};