leetcode-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.
第一种解法:

public class Solution {
    public int findContentChildren(int[] g, int[] s) {
        Arrays.sort(g);
        Arrays.sort(s);
        int i=0;
        int y=-1;
		for(int j=0;j<g.length;j++){
			Boolean a=false;
			for(int k=y+1;k<s.length;k++){
				if(g[j]<=s[k]){
					a=true;
					y=k;
					break;
					
				}
			}
			if(a){
				i++;
			}
			
		}
        return i;
    }
}

　　这是我首先想到的，但是效率不高。

第二种解法:

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

　　

 

转载于:https://www.cnblogs.com/lcbg/p/6561062.html