分配餅乾 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] //第一個是知足值，第二個是cookie數目
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.

解決：

① 典型的貪心算法，給定一堆cookie，每一個cookie的大小不一樣，還有一堆小朋友，每一個小朋友的胃口也不一樣的，問咱們當前的cookie最多能知足幾個小朋友。

一、首先把兩個數組排序

二、若是當前餅乾大小小於知足感，指針前移，不然兩個指針都前移。

三、最後返回指向孩子指針的指針位置

class Solution { //18ms     public int findContentChildren(int[] g, int[] s) {         Arrays.sort(g);         Arrays.sort(s);         int p1 = 0;         int p2 = 0;         while(p1 < g.length && p2 < s.length){             if(g[p1] <= s[p2]) p1 ++;             p2 ++;         }         return p1;     } }