455. Assign Cookies - Easy

最新推荐文章于 2024-11-11 20:59:17 发布

木木______

最新推荐文章于 2024-11-11 20:59:17 发布

阅读量220

点赞数

分类专栏： leetcode_算法文章标签： leetcode 分饼干

本文链接：https://blog.csdn.net/qq_33559972/article/details/78279151

版权

leetcode_算法专栏收录该内容

17 篇文章 0 订阅

订阅专栏

Description

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.

Analyze

分小饼干？哦呵呵，这题炒鸡萌！
也很容易就能想到解决办法啊：我总是优先给最乖巧不贪心的孩子分饼干，但总是最小气地分给他能接受的最小饼干，这样能保证我是个awesome parent（大雾）。每次分饼干的动作都是安全的，不会伤害到最优解。
实现上：先给孩子们排排坐，最乖的孩子坐前边，再码放好饼干——两个数组都升序排序。然后到每个孩子面前的时候，从最小的饼干开始找，直到找到一块符合要求的就给他，然后给下一个孩子饼干。直到有个孩子再也得不到他的饼干。

Code

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]) {
                i++;
                j++;
            }
            else j++;
        }
        return i;
    }
};