leetcode-455. Assign Cookies

455. 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.

题意：

假设给定 s ，g 两个数组，有 s.length 个孩子，g.length 的饼干，s 中的数字表示每个孩子需要的最少饼干的大小， g 中的元素表示你所拥有的每块饼干的大小。

要求每个孩子只能给一块饼干，必须满足大小的要求

求满足条件的孩子的数量

解析：对于每个孩子的要求，只需要给大于要求的最小饼干即可。 所以排序完成后，一个个找即可

solution:

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

    }
}

转载于:https://www.cnblogs.com/linkcode/p/8150770.html