LeetCode-Assign Cookies

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/qq_24133491/article/details/83243051

Description：
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.

题意：给定两个数组g，s；其中g 表示每个儿童对蛋糕的贪贪心数值，s表示每个蛋糕可满足的贪心的数值；现要求计算最多可满足多少个儿童；

解法：我们可以将数组g和s按照从小到大排序，遍历数组g，依次将s中可满足的蛋糕分配出去；

Java

class Solution {
    public int findContentChildren(int[] g, int[] s) {
        int cnt = 0;
        Arrays.sort(g);
        Arrays.sort(s);
        int index = 0;
        for (int i = 0; i < g.length;) {
            if (index >= s.length) break;
            if (s[index] >= g[i]) {
                cnt++;
                index++;
                i++;
            } else {
                index++;
            }
        }
        
        return cnt;
    }
}