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.题目超长,总结起来就是要把饼干分给孩子,每个孩子都有一个期望的饼干大小,每个孩子只能分得一块饼干,问你的饼干能满足多少个孩子。将欲望数组和饼干数组排序,逐一向后比较,如果能满足,count加一,不能满足,换后面的大饼干跟孩子的欲望比较,一直到两个数组某一个被比完为止。代码如下:
public class Solution {
public int findContentChildren(int[] g, int[] s) {
Arrays.sort(g);
Arrays.sort(s);
int i = 0, j = 0;
int max = 0;
while (i < g.length && j < s.length) {
if (s[j] >= g[i]) {
i ++;
j ++;
max ++;
} else {
j ++;
}
}
return max;
}
}