[leetcode] 455. Assign Cookies 解题报告

题目链接：https://leetcode.com/problems/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

思路：将两个数组都按降序排列之后+two pointer。也就是利用一个贪心先拿最大的饼干喂给最大的孩子，如何孩子不要就喂给下一个孩子；如果孩子要了就再用下一个饼干尝试喂下一个孩子。贪心的基本思路是保证每一步都是最优解，这也是证明贪心正确性的充分必要条件。在这题中每次选择最大的饼干喂给最大的孩子可以使得利益最大化，也就是如果这个最大的饼干不喂给最大的孩子，则可能导致再也没有一个其他饼干能满足这个孩子。

代码如下：

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        sort(g.begin(), g.end(), greater<int>());
        sort(s.begin(), s.end(), greater<int>());
        int ans = 0, leng = g.size(), lens = s.size(), gPos = 0, sPos = 0;
        while(gPos < leng && sPos < lens)
        {
            if(s[sPos] < g[gPos]) gPos++;
            else ans ++, sPos++, gPos++;
        }
        return ans;
    }
};