描述: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.
题目的意思很简单，就是得到最多可以满足的孩子数量
自己的思路：采用贪心策略，从后面向前面遍历，从cookie的角度出发，总是把最大的sj分配给gi最大的孩子，有点类似于操作系统的....（之后补充）
public int findContentChildren(int[] g, int[] s) {Arrays.sort(g);Arrays.sort(s);int count = 0;for (int i = g.length-1, j = s.length-1; i >= 0 && j >=0; i--) {if (g[i] <= s[j]){count++;j--;}}return count;}
dalao的思路：采用贪心策略，从前面向后面遍历，从children的角度出发，总是先满足gi最小的孩子
if(g.length == 0 || s.length == 0)return 0;Arrays.sort(g);Arrays.sort(s);int i, j;for(i = 0, j = 0; i < g.length && j < s.length; j++){if(g[i] <= s[j])i++;}return i;
summary：想得到最值的number，因此此题的贪心策略出发点比较简单，总是先满足需求最大/最小的个体