【Leetcode】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:

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.

---

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.

---

思路：

本题需要注意两个输入条件，一个是数组的个数，一个是数组元素的大小。数组的个数意味着孩子或者饼干的数量，数组元素的大小则意味着孩子达到满足的要求或饼干的大小。两个数组间的最大匹配度就是所需要的输出。这个问题又可以看做是图论里面的二部图，就是找最大匹配。对于解决这个问题，很自然地可以想到用贪心算法。在这里要注意的是，使用贪心算法前需要对输入数组都进行一次升序排序，才能保证使用贪心算法得到的结果是安全稳定的。

以下是用C++实现的过程：

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        //使用内部排序算法进行排序，需要在文件头部加入#include<algorithm>
        sort(g.begin(),g.end());
        sort(s.begin(),s.end());
        int i=0,j=0;
        while(i<g.size() && j<s.size()){
            if(s[j]>=g[i]){
                i++;
            }
            j++;
        }
        return i;
    }
};