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
};
本文探讨了一个经典的分配问题:如何将不同大小的饼干分配给一群孩子,让尽可能多的孩子得到满意的饼干。通过排序和遍历的方法,实现了一种有效的算法。
1146

被折叠的 条评论
为什么被折叠?



