455.assign cookies

ssume 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.

思路：
来自这里
有一堆饼干和一堆孩子，每个饼干大小为s[j]，每个孩子想要的大小为g[i]，求这堆饼干能满足至多多少个孩子？
很容易想到，每个孩子尽量拿到和他想要的大小差距最小的饼干，就能保证不会“浪费”大块饼干。因此把g和s排序后，把最相邻的饼干分给刚刚好满足的孩子，就能得到最大的满足数量了。

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

---

我代码报错了，还没思考清楚为啥，先占坑

class Solution {
public:
    static int findContentChildren(vector<int>& g, vector<int>& s) {
        int sum = 0;
        for (auto child : g) {
            auto least = s.begin();
            bool flag = false;  // false表示least不是满足题意的least,即s.begin()
                                //true表示是真的least
            for (auto it = s.begin(); it < s.end(); it++) {
                if (child <= *it) {
                    if (flag) {  // 真的least
                        least = it;
                    }
                    else {  // false表示least不是满足题意的least, 即s.begin()
                        least = it;
                        flag = true;
                    }
                }
            }
            if (least != s.end() && child <= *least) {
                s.erase(least);
                sum++;
            }
        }
        return sum;
    }
};

简单的测试样例都可以过，然而这个没过2333…….