week5-NO.455. Assign Cookies

题目

• Total Accepted: 19294
• Total Submissions: 40961
• Difficulty: Easy
• Contributors: µsic_forever

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.

https://leetcode.com/problems/assign-cookies/#/description

思路

题目需要让尽可能多的孩子得到蛋糕

思路是先满足贪心系数低的孩子是最划算的，并且给他能满足他的蛋糕中大小最小的蛋糕也是最划算的。

所以先把两个数组都按从小到大排序，然后按照排序为每一个孩子分配蛋糕，分配给他蛋糕序列中第一个能满足他的蛋糕，即最小的蛋糕。

源程序

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        int i,j,t,n = 0,max;
        sort(g.begin(),g.end());
        sort(s.begin(),s.end());
        j = 0;
        for(i = 0;i < g.size();i ++){
            while(j < s.size()){
                if(s[j] >= g[i]){
                    n ++;
                    j ++;
                    break;
                }
                j ++;
            }
        }
        return n;
    }
};