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: 1Explanation: 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: 2Explanation: 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 Solution {    public int findContentChildren(int[] g, int[] s) {        int i=0,j=0,count=0;        Arrays.sort(g);        Arrays.sort(s);        while(i<g.length&&j<s.length)        {            if(g[i]<=s[j])            {                count++;                j++;                i++;            }            else j++;        }        return count;    }}

上面是以小孩子为主，饼干递进

转变一种思路，以饼干为主，小孩子欲望递减

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