Assign Cookies

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: 1Explanation: 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: 2Explanation: 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.

‘

`public class Solution {    public int findContentChildren(int[] g, int[]s){        Arrays.sort(g);        Arrays.sort(s);        int i = 0, j = 0, count = 0;        while(j < s.length && i < g.length) {            if(s[j] >= g[i]) {                count++;                j++;                i++;            }            else {                j++;            }        }        return count;    }}`

这道题的思路很简单，首先很容易想到排序可以帮我们解决比较gi和si时大小顺序不一致引起的误判，即可以满足的孩子没有算，不可以满足的孩子算上去这种情况。排序完，我们用两个指针i,j分别对应两个数组，这样我们遇到si > gi时，我们就可以同时移动指针，并count+1,不满足，我们就接下来找下一个cookie看看满不满足当前孩子。
while循环里的条件，同时考虑到了两种情况，即g.length > s.length 或s.length > g.length时，会出现越界访问。