欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识!
您现在的位置是: 首页

455. Assign Cookies

程序员文章站 2022-06-04 15:44:46
...

原题

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.

代码实现

greedy algorithm

    public int FindContentChildren(int[] g, int[] s) {
            //g=[2,1,3] //i
            //s=[1,1]  //j
            Array.Sort(g);
            Array.Sort(s);
            int rtn = 0;
            for (int i = 0, j = 0; i < g.Length && j < s.Length; j++) //cookies
            {
                if (g[i] <= s[j]) //gratify
                {
                    rtn++;
                    i++;
                }
            }
            return rtn;
    }

455. Assign Cookies

题库

Leetcode算法题目解决方案每天更新在github库中,欢迎感兴趣的朋友加入进来,也欢迎star,或pull request。https://github.com/jackzhenguo/leetcode-csharp