【LeetCode】455. Assign Cookies

问题描述

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.

例子

Input: [1,2,3], [1,1]
Output: 1

Input: [1,2], [1,2,3]
Output: 2

思路

这道题其实是简化了的最优分配问题，因为每一个小孩最多只能得到一块曲奇，所以，我们只需要让更多的小孩满足需求即可。
- 首先，将小孩的贪心值gi和曲奇的大小si进行排序。
- 然后从最不贪心的小孩开始遍历，从小到大遍历饼干直到满足其需求。
- 将已被分配的曲奇做个标记。继续遍历。
- 这样，做到大曲奇可以给到更贪心的小孩，使更多小孩得到满足。

代码

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        if (g.size() == 0 || s.size() == 0) return 0;
        sort(g.begin(), g.end());
        sort(s.begin(), s.end());
        int flag[s.size()] = {0};
        int result = 0;

        for (int i = 0; i < g.size(); i++) {
            for (int j = 0; j < s.size(); j++) {
                if (!flag[j] && s[j] >= g[i]){
                    flag[j] = 1;
                    result++;
                    break;
                }
            }
        }
        return result;
    }
};