【leetcode】455. Assign Cookies

最新推荐文章于 2023-01-20 12:14:56 发布

于博洋

最新推荐文章于 2023-01-20 12:14:56 发布

阅读量252

点赞数

分类专栏： leetcode 文章标签： leetcode 贪心算法

本文链接：https://blog.youkuaiyun.com/no553216989/article/details/70188602

版权

leetcode 专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一个经典的分配问题——如何通过贪心算法来最大化满足孩子的饼干需求。该问题中，每个孩子有一个满意度阈值，每块饼干有一个大小；目标是通过合理分配饼干使得满意的孩子数量最多。

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

题目：

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.

思路：利用贪心算法，先将两个数组排序，之后让需求最小的孩子和供给最小的饼干比较，若孩子较小，则把饼干分配给孩子否则比较下一个饼干，以此类推。

代码：

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

class Solution {
public:
int findContentChildren(vector<int>& g, vector<int>& s) {
if (g.empty() || s.empty()) return 0;
sort(g.begin(),g.end());
sort(s.begin(), s.end());
int res = 0;
int j = 0;
int i = 0;
while (i < g.size()&& j < s.size()) {
if (g[i] <= s[j]) {
i++;
j++;
res++;
}
else {
j++;
}
}
return res;
}
};