https://leetcode.com/problems/assign-cookies/description/
解题思路：
对两个数组分别排序，然后从最小的cookies给最小的孩子开始
class Solution {
public int findContentChildren(int[] g, int[] s) {
Arrays.sort(g);
Arrays.sort(s);
int child = 0;
int cookie = 0;
while(child < g.length && cookie < s.length){
if(g[child] <= s[cookie]){
child++;
}
cookie++;
}
return child;
}
}
