Assign Cookies

[leetcode]Assign Cookies

链接：https://leetcode.com/problems/assign-cookies/description/

Question

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());
    sort(g.begin(), g.end());
    int s_i = s.size()-1;
    int g_i = g.size()-1;
    int cnt = 0;
    while (g_i >= 0 && s_i >= 0) {
      if (s[s_i] >= g[g_i]) {
        cnt++;
        g_i--;
        s_i--;
      } else {
        g_i--;
      }
    }
    return cnt;
  }
};

思路：对孩子和cookie从小到大排序，挑最大的cookie开始分给小孩子们（对需求高的孩子优先满足）。假设有一个cookie的size为c，一个孩子的需求是b，另一个需求是a（b > a），优先将cookie分给b，因为后面的cookie比c小，可能满足a而不能满足b。