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[j]满足小孩的需求g[i]即可。首先将小孩序列与饼干序列从小到大排序,再比较s[j]与g[i]大小。若s[j]>g[i],则这个饼干可以满足条件,即count++。当饼干分完了,或小孩都给了饼干,则结束,返回给出的饼干数count。
class Solution {
public int findContentChildren(int[] g, int[] s) {
int count = 0;//需要先排序,第一次就忘记了
Arrays.sort(g);
Arrays.sort(s);
int i = 0; // num of childrens g[i]
for(int j=0;j<s.length;j++) // remaining candies:s[j]
{
if(g[i] <= s[j])
{
count++;
i++;
if(i == g.length)
return count;
}
}
return count;
}
}
博主学习笔记,转载请注明出处,有错望指正,谢谢~^-^