package com.fishercoder.solutions;

import java.util.Arrays;

/**
 * 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.*/

public class _455 {

    public static class Solution1 {
        public int findContentChildren(int[] g, int[] s) {
            Arrays.sort(g);
            Arrays.sort(s);

            int result = 0;
            for (int i = 0, j = 0; i < g.length && j < s.length; ) {
                if (s[j] >= g[i]) {
                    result++;
                    i++;
                }
                j++;
            }
            return result;
        }
    }

}

@@ -59,1165 +59,8 @@
 s;%0A%0A
-/**%0A * 455. Assign Cookies%0A *%0A * Assume you are an awesome parent and want to give your children some cookies.%0A * But, you should give each child at most one cookie.%0A * Each child i has a greed factor gi, which is the minimum size of a cookie%0A * that the child will be content with;%0A * and each cookie j has a size sj. If sj %3E= gi, we can assign the cookie j to the child i,%0A * and the child i will be content. Your goal is to maximize the number of your content children and output the maximum number.%0A%0A Note:%0A You may assume the greed factor is always positive.%0A You cannot assign more than one cookie to one child.%0A%0A Example 1:%0A Input: %5B1,2,3%5D, %5B1,1%5D%0A Output: 1%0A Explanation: You have 3 children and 2 cookies. The greed factors of 3 children are 1, 2, 3.%0A 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.%0A You need to output 1.%0A%0A Example 2:%0A Input: %5B1,2%5D, %5B1,2,3%5D%0A Output: 2%0A Explanation: You have 2 children and 3 cookies. The greed factors of 2 children are 1, 2.%0A You have 3 cookies and their sizes are big enough to gratify all of the children,%0A You need to output 2.*/%0A%0A
 publ

refactor 455