LeetCode 455. Assign Cookies

最新推荐文章于 2022-08-07 22:22:55 发布

reborncgy

最新推荐文章于 2022-08-07 22:22:55 发布

阅读量172

点赞数

CC 4.0 BY-SA版权

文章标签： C++ leetcode 贪心算法

本文链接：https://blog.csdn.net/reborncgy/article/details/78396998

本文介绍了一个经典的分配问题——分配饼干问题。目标是在给定不同大小的饼干和孩子们对饼干大小需求的情况下，通过适当的分配使尽可能多的孩子满意。文章详细解释了问题背景、约束条件，并提供了一个高效的解决方案。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

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.

代码如下：class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        sort(g.begin(), g.end()); 
        sort(s.begin(), s.end());
        int result = 0;
        int child = 0;
        
        for (int i = 0; i < s.size(); i++) {
            if (s[i] >= g[child]) {
                result++;
                child++;
                if (child == g.size())
                    break;
            }          
        }
        return result;
    }
};