LeetCode知识点总结 - 455

LeetCode 455. Assign Cookies

考点	难度
Array	Easy

题目

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 g[i], which is the minimum size of a cookie that the child will be content with; and each cookie j has a size s[j]. If s[j] >= g[i], 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.

重点

非常简单的greedy algorithm，把两个array都从小到大排，按顺序匹配。如果匹配成功则在结果上加一。
对于greedy algorithm的介绍：https://zhuanlan.zhihu.com/p/53334049

答案

public int findContentChildren(int[] g, int[] s) {
	Arrays.sort(g);
	Arrays.sort(s);
	int count = 0;
	for(int j=0; count<g.length && j<s.length; j++) {
		if(g[count]<=s[j]) count++;
	}
	return count;
}