[leetcode]: 455. Assign Cookies

1.题目描述

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.

翻译：家长给一群小孩分饼干，让每个小孩满意的饼干大小为一个数组s，家长有的饼干大小g为一个数组。每个饼干不能拆分，一个小孩最多拥有一个饼干。求最多能让多少个小孩满意。

例子：
g=[1,2,3],s=[1,1] 输出1
g=[1,2],s=[1,2,3] 输出2

2.分析

贪心算法，优先满足饼干数少的孩子。
需要对两个数组排序，然后从数组左边开始遍历，判断。

3.代码

c++

int findContentChildren(vector<int>& g, vector<int>& s) {
    sort(g.begin(), g.end());
    sort(s.begin(), s.end());
    int i = 0;//标记child中的位置
    int count = 0;//计数，有多少小孩得到cookie
    for (int n : s) {
        if (n >= g[i])
            ++i;
        if (i >= g.size())
            break;
    }
    cout << i << endl;
    return i;
}