LeetCode 455. Assign Cookies

455. Assign Cookies

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 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.

Solution

• 题意即，第二个数组代表饼干尺寸，第一个数组代表要满足每个人胃口的最小尺寸，将第二个数组的饼干分配给第一组的孩子，问最多分配多少饼干.
• 可以用贪心的思想解决该问题，也就是对于每一个孩子，如果能分配的话，我们尽量分配最小的给他.
• 于是我们将饼干尺寸排序，对于每一个孩子，去寻找他们最小的满足尺寸，代码如下

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        sort(s.begin(),s.end());
        vector<int>::iterator i,j;
        int rnt = 0;
        for (i = g.begin();i != g.end();i++) {
            for (j = s.begin();j != s.end();j++) {
                if (*i <= *j) {
                    rnt++;
                    s.erase(j);
                    break;
                }
            }
        }
        return rnt;
    }
};