Leetcode算法学习日志-455 Assign Cookies

最新推荐文章于 2022-06-29 21:34:32 发布

Zarlove

最新推荐文章于 2022-06-29 21:34:32 发布

阅读量263

点赞数

分类专栏：算法，leetcode，动态规划，C++，贪心算法文章标签： C++ leetcode 算法贪心

本文链接：https://blog.csdn.net/Zarlove/article/details/78116539

版权

算法，leetcode，动态规划，C++，贪心算法专栏收录该内容

5 篇文章 0 订阅

订阅专栏

Leetcode 455 Assign Coolies

题目原文

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.

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.

题意分析

题目中每个孩子都有一个贪婪值，每个饼干有个大小，如果饼干大小大于或等于这个孩子的贪婪值，则他能够被满足。题目要求最大能满足的孩子数量。不能给一个孩子多个饼干。

解法分析

本题采用贪心思想，因为目的是孩子越多越好，所以先满足贪婪度最小的孩子，此为贪心选择，剩下的子问题也拥有最优子结构。C++代码如下：

class Solution {
public:
    int findContentChildren(vector<int>& g, vector<int>& s) {
        sort(g.begin(),g.end());
        sort(s.begin(),s.end());
        auto ng=g.size();
        auto ns=s.size();
        if(ng==0||ns==0)
            return 0;
        int count=0;
        int i;
        for(i=0;i<ns;i++){
            if(s[i]>=g[count])
                count++;
            if(count==ng)
                break;       
        }
        return count;  
    }
};