[LeetCode] Assign Cookies

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.

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.

找出饼干尺寸比贪婪因素大的个数，首先将两个数组排序，然后使用两个索引查找符合要求的值，如果找到则两个索引都+1，如果没找到，则让饼干尺寸的索引+1。

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        sort(g.begin(), g.end());
        sort(s.begin(), s.end());
        int res = 0, tmp = 0;
        while (res != g.size() && tmp != s.size()) {
            if (g[res] <= s[tmp]) {
                res++;
                tmp++;
            }
            else
                tmp++;
        }
        return res;
    }
};
// 43 ms

 

转载于:https://www.cnblogs.com/immjc/p/7168820.html