#Leetcode算法博客

最新推荐文章于 2024-04-01 11:08:17 发布

原创最新推荐文章于 2024-04-01 11:08:17 发布 · 263 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #leetcode

学习日记专栏收录该内容

17 篇文章

订阅专栏

本文介绍了一个经典的LeetCode问题——分配饼干。此问题旨在通过贪心算法最大化满足条件的孩子数量。文章详细解释了如何通过排序和匹配策略来解决该问题，并提供了一个C++实现示例。

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 i = g.size() - 1;
        int j = s.size() - 1;
        int count = 0;
        while (i >= 0 && j >= 0) {
            if (g[i] > s[j]) {
                i--;
            } else if (g[i] <= s[j]) {
                count++;
                j--;
                i--;
            }
        }
        return count;
    }
};