【leetcode】solution in java——Easy5

转载请注明原文地址：

21：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 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.

此题：分点心。每个小孩i期望获得g[i]块点心。你有多种不同口味的点心s[]。你只能分配一种口味的点心给一个小孩而且点心数量大于g[i]小孩i才会满意。问你最多能满足多少个小孩？

思路：对小孩的期望数组与拥有的点心数组按升序排列，从需求小的小孩开始逐个满足：针对当前需求，检索还没分配的点心数组，把第一个能满足需求的点心分给这个小孩。