LeetCode week 5 : Assign Cookies

题目

地址：
https://leetcode.com/problems/assign-cookies/description/
类别： Greedy
难度： Easy
描述：
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 g_i, which is the minimum size of a cookie that the child will be content with; and each cookie j has a size s_j. If s_j >= g_i, 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

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.

分析

题目主要讲了把一堆曲奇饼分给孩子的问题：曲奇饼j大小为s_j，孩子i的最低期望值（想得到的曲奇饼大小的最小值）为g_i，如果最后孩子i分得的曲奇饼j满足孩子的最低期望（即s_j >= g_i），则这个孩子心满意足，最后给定一堆曲奇饼和一组孩子的最低期望值，求最佳分配方式使最后满足的孩子人数最多并求出人数值。
对此的贪心策略很简单，每次先满足期望值最低的孩子即可，而在分配给这个期望值最低的孩子曲奇饼时，选择当前能满足他的最小曲奇饼。
为了便于查找最小值，在分配之前我们最好先排序以降低复杂度。

代码实现

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        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]) {
                j++;
                i++;
            } else {
                j++;
            }
        }
        return i;    //这里不用设置count，直接利用i就可以
    }
};

一个思考

想要的最多的可能最后一无所获，想要的最少的虽然有很大几率能得到，但一定很少，所以期望值大小的选取很重要。