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.
这道题感觉跟情景没什么关系,分别用两个指针 index1, index2指向这两个已经按照从小到大的顺序排列好的数组的头,然后开始找,如果nums2[index2] >= nums1[index1], 那么可以把index2这个cookie分配过去,index1++, index2++; 否则,index2++。
代码:
public int findContentChildren(int[] g, int[] s) {
Arrays.sort(g);
Arrays.sort(s);
int index1 = 0;
int index2 = 0;
while(index1<g.length && index2<s.length){
if(s[index2]>=g[index1]){
index2++;
index1++;
}else{
index2++;
}
}
return index1;
}