题目如下:
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.
我的提交:
//17.3.29
//排序后使用贪心
import java.util.Arrays;
public class Solution {
public int findContentChildren(int[] g, int[] s) {
Arrays.sort(g);
Arrays.sort(s);
int count = 0,gi = 0 ,si = 0 ;
while(gi<g.length&&si<s.length){
if(s[si]>=g[gi]){
count++;
gi++;
si++;
}
else{
si++;
}
}
return count;
}
}
排序后,分配给孩子的饼干一定是能满足他而且最小的那个。
网友评论