LeetCode-455. Assign Cookies (Java)

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.

------------------------------------------------------------------------------------------------------------------------------------

题意

就是有n个孩子面前有一堆饼干，每个孩子想要的饼干数为g，每个饼干的尺寸为s，现在要求饼干最大能满足多少个孩子。

解题思路

既然要求最大能满足孩子的数量，那就是当孩子期望的饼干尺寸，与现有饼干尺寸相差较近时，可以求得其最大。

比如孩子期望的饼干尺寸分别为：1，2。饼干的尺寸有：3，1。则当分法为：1==1，2==3时，最多能满足两个。

如果这样分：1==3，2==1。则只能满足一个孩子。所以，首先需要对两个数组进行排序，然后从小到大分配饼干给孩子。

代码如下：

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