Assign Cookies问题及解法

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

我们要爱学习

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

阅读量225

点赞数

分类专栏： LeetCode算法练习（Easy）文章标签： LeetCode Easy Greedy

本文链接：https://blog.csdn.net/u011809767/article/details/70352826

版权

LeetCode算法练习（Easy）专栏收录该内容

156 篇文章 3 订阅

订阅专栏

问题描述：

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 g_i, which is the minimum size of a cookie that the child will be content with; and each cookie j has a size s_j. If s_j >= g_i, 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.

示例：

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.

问题分析：

要想满足更多的孩子的需求，我们只需要最小化s和g之间的差值和即可：将s和g升序排序，然和比较s和g中的元素。

过程详见代码：

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