描述
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.
1.You may assume the greed factor is always positive.
2.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.各自排序，從最小的開始，依次看是否滿足。
參考博客：http://www.cnblogs.com/grandyang/p/6077344.html
class Solution {
public:
/**
* @param g: children's greed factor
* @param s: cookie's size
* @return: the maximum number
*/
int findContentChildren(vector<int> &g, vector<int> &s) {
// Write your code here
int result=0;
int p=0;
sort(g.begin(),g.end());
sort(s.begin(),s.end());
for(int i=0;i<s.size();i++){
if(s[i]>=g[p]){
++result;
++p;
if(p>=g.size()) break;
}
}
return result;
}
};