455. Assign Cookies

455. Assign Cookies

Description Hints Submissions Discuss Solution

Discuss Pick One

---

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.

---

Seen this question in a real interview before?

题意：

你要分配饼干给孩子们，每一块饼干的大小是s[]，每个孩子期望得到饼干的大小是g[]，问，最多能满足多少个孩子的要求

算法思路:

首先先对两个数组从小到大排序

然后比较两个数组的大小，如果拥有的大于等于预期的，就把计数器加1，两个数组同时后移

否则，预期的数组后移

代码；

package easy;

import java.util.Arrays;

/*
@author wchstrife
@version 2017年8月21日下午8:09:53
*/
public class AssignCookies {
	
	public int findContentChildren(int[] g, int[] s) {
		
		Arrays.sort(g);
		Arrays.sort(s);
		
        int i = 0;
        int j = 0;
        int result = 0;
        
        while (i<g.length && j<s.length) {
        	if(g[i] <= s[j]){
        		i++;
        		j++;
        		result++;
        	}else {
				j++;
			}						
		}
        
        return result;
    }

}