Description
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
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.
Example 2:
Input: [1,2], [1,2,3]
Output: 2
Explanation: You have 2 children and 3 cookies. The greed factors of 2 children are 1, 2.
You have 3 cookies and their sizes are big enough to gratify all of the children,
You need to output 2.
Analysis
Simple Greedy Algorithm. Empty set should be considered.
Code
bool cmp(int a,int b)
{
return a>b;
}
class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
if (s.size() == 0 || g.size() == 0) return 0;
sort(g.begin(),g.end(),cmp);
sort(s.begin(),s.end(),cmp);
int j = 0, result = 0;
for (int i = 0;i < g.size(); i++){
if (s[j] < g[i]) continue;
result++;
if (j < s.size()-1) j++;
else return result;
}
return result;
}
};
Appendix
- Link: https://leetcode.com/problems/assign-cookies/
- Run Time: 63ms
- The function sort(begin,end,compare) has a good efficient (about
O(n2logn) ).