leetcode_455. Assign Cookies 分配饼干，java数组的排序

题目：

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.

题意：

假设你是一个非常棒的父母，并想给你的孩子一些饼干。 但是，你应该给每个孩子至多一块饼干。 每个孩子i都有一个贪心因子gi，这是孩子将要拥有的饼干的大小的衡量标准; 并且每块饼干 j具有大小sj。 如果sj> = gi，我们可以将饼干j分配给孩子i，孩子i将得到满足。 您的目标是最大化满足您的孩子的数量，并输出最大数量。

代码：

public class Solution {

    public int findContentChildren(int[] g, int[] s) {

        Arrays.sort(g);    //将孩子的欲望从小到大排序

        Arrays.sort(s);    //将饼干的大小从小到大排序

        

        int n = g.length;    //计算孩子个数

        int m = s.length;     //计算饼干数量

        

        int i=0;

        int j=0;

        int res = 0;       //记录得到满足的孩子个数

        

        while(i < n) {      //遍历孩子

            while(j<m) {       //遍历饼干

                if(g[i]<=s[j]){         //有孩子能得到满足

                    res++;            //结果加1

                    i++;             //孩子加1

                    j++;              //饼干加1

                    break;             //跳出当前孩子的饼干遍历，为下一个孩子遍历饼干

                }

                else {             //当前孩子对饼干j不满足，继续遍历下一块饼干

                    j++;

                }

            }

            if(j==m){               //如果饼干遍历完了，则跳出搜索，后面的孩子都得不到满足，不用继续遍历了

                break;

            }

        }

        

        return res;            //返回得到满足的孩子数目

    }

}

笔记：

java的排序函数：

Arrays.sort(g);     默认对int[]，double[]，char[]类型的数据从小到大升序排序；