算法分析与设计第七周作业

最新推荐文章于 2022-04-10 22:32:43 发布

jjkhhu

最新推荐文章于 2022-04-10 22:32:43 发布

阅读量183

点赞数

分类专栏：个人作业

本文链接：https://blog.csdn.net/jjkhhu/article/details/83246638

版权

个人作业专栏收录该内容

19 篇文章 0 订阅

订阅专栏

算法分析与设计第七周作业

题目

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.
题目传送门

解读

有一堆饼干和一堆孩子，每个饼干大小为s[j]，每个孩子想要的大小为g[i]，求这堆饼干能满足至多多少个孩子？
这是一个贪心算法能够解决的问题，很容易想到，每个孩子尽量拿到和他想要的大小差距最小的饼干，就能保证不会“浪费”大块饼干。因此把g和s排序后，把最相邻的饼干分给刚刚好满足的孩子，就能得到最大的满足数量了。

解答

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

        return count;
    }
};

解答详情传送门