455. 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.
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.
Example 2:
Input: [1,2], [1,2,3]
Output: 2
Explanation: You have 2 children and 3 cookies. The greed factors of 2 children are 1, 2.
You have 3 cookies and their sizes are big enough to gratify all of the children,
You need to output 2.
题目“分配饼干”,给定两个数组,分别表示每个小孩期望的饼干大小,和每个饼干实际的大小。将饼干分配给这些小孩,但分配的饼干大小必须不小于小孩期望的饼干大小。求出这些饼干最多可以满足几个小孩。
解题思路
简单的贪心算法,将两个数组排序,然后从s数组开始,找g中是否有满足条件的因子,没有可以直接跳过,因为太小不足以分给其中的小孩能满足的最小的大小了。
class Solution {
public int findContentChildren(int[] g, int[] s) {
Arrays.sort(g);
Arrays.sort(s);
int i = 0;
for(int j=0;i<g.length && j<s.length;j++) {
if(g[i]<=s[j]) i++;
}
return i
}
}