Leetcode455. 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: 1

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

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

二、思路

1、先将两个数组按升序的顺序排序

2、使用两个变量分别指向两个数组，i指向g，j指向s

3、若是当前饼干大小小于孩子的满足感，即s[j]<g[i]则指针前移，否则指针都前移

三、代码

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