455. Assign Cookies*-优快云博客

本文链接：https://blog.youkuaiyun.com/alwaystry/article/details/54565103

本文探讨了一个经典的分配问题——如何将不同大小的饼干分配给有不同需求的孩子们，使得尽可能多的孩子满意。通过两种不同的代码实现方式，展示了如何使用排序和循环来解决这个问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

My code:

    public int findContentChildren(int[] g, int[] s) {
        int result=0;
        if(s.length==0||g.length==0) return result;
        Arrays.sort(g);
        Arrays.sort(s);
        int k=0;
        for(int i=0;i<g.length&&k<s.length;i++){
            while(s[k]<g[i]&&k<s.length-1) k++;
            if(s[k]>=g[i]) {
                result++;
                k++;
            }
            else break;
        }
        return result;
    }

总结：棒极了

    public int findContentChildren(int[] g, int[] s) {
        Arrays.sort(g);
        Arrays.sort(s);
        int i=0;
        for(int j=0;i<g.length&&j<s.length;j++){
            if(g[i]<=s[j]) i++;
        }
        return i;
    }

总结：看看人家的代码。其实while循环可以用for代替，对s进行循环而不是对g进行循环。