LeetCode 455. Assign Cookies 饼干分配

LeetCode

字数统计: 319阅读时长: 1 min

 2020/02/19   Share

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.

Resolution

//Java
class Solution {
    public int findContentChildren(int[] g, int[] s) {
       int num = 0;
       Arrays.sort(g);
       Arrays.sort(s);
       int j = 0;
       for(int x : g){
           while( j < s.length && x > s[j] ){
               ++j;
           }
           if(j < s.length && s[j] >= x){
               ++num;
               ++j;
           }
       }
       return num;
    }
}

Time Complexity: $O(nlogn)$ takes time in sorting algrithm

Space Complexity:$O(1)$

Note：

Greedy Algorithm，Control the children and set j point points to the cookies that has been sorted.

Next Post

LeetCode 404. Sum of Left Leaves 左叶子结点值之和
Previous Post

LeetCode 461 Hamming Distance 汉明距离

CATALOG

1. 455. Assign Cookies 饼干🍪分配

Note:

Example 1:

Resolution

