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.

var findContentChildren = function(g, s) {
    g.sort(function(a,b) {return a - b});
    s.sort(function(a,b) {return a - b});
    var count = 0;
    for(var j=0; count < g.length && j < s.length; j++) {
        if(g[count] <= s[j]) count++;
    }
    return count
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值