Leetcode 455. Assign Cookies

最新推荐文章于 2025-10-15 11:24:24 发布

原创最新推荐文章于 2025-10-15 11:24:24 发布 · 227 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#leetcode

leetcode 专栏收录该内容

20 篇文章

订阅专栏

本文介绍了一个经典的LeetCode问题——分配饼干。通过贪心算法解决如何最大化满足孩子的数量，并提供了具体的实现代码。

Leetcode 455. Assign Cookies

source url

题目描述

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.

输入：
输出：排序后的队伍
如：

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.

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.

思路

贪心算法：先对输入的两个序列对从小到大排序，随后对饼干进行一次遍历。当当前饼干大小能满足该孩子的需求时，则满足度+1，否则判断下一块饼干的大小。

代码

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        int j = 0;
        int ret = 0;

        sort(g.begin(), g.end());
        sort(s.begin(), s.end());

        for(int i =0;i<s.size();i++){
            if(s[i]>=g[j]&&j<g.size()){
                ret++;
                j++;
            }
        }
        return ret;
    }
};