455. Assign Cookies(easy)

Easy

36369FavoriteShare

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.

 

从大到小法:

C++:

/*
 * @Autor: SourDumplings
 * @Date: 2019-09-26 10:27:42
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/assign-cookies/
 */

class Solution
{
public:
    int findContentChildren(vector<int> &g, vector<int> &s)
    {
        sort(g.rbegin(), g.rend());
        sort(s.rbegin(), s.rend());
        int res = 0;
        int i = 0;
        int n = g.size();
        for (auto &&c : s)
        {
            while (i < n && c < g[i])
            {
                ++i;
            }
            if (i == n)
            {
                break;
            }
            ++res;
            ++i;
        }

        return res;
    }
};

 从小到大法:

Java:

import java.util.Arrays;

/*
 * @Autor: SourDumplings
 * @Date: 2019-09-26 10:40:11
 * @Link: https://github.com/SourDumplings/
 * @Email: changzheng300@foxmail.com
 * @Description: https://leetcode.com/problems/assign-cookies/
 */

class Solution
{
    public int findContentChildren(int[] g, int[] s)
    {
        Arrays.sort(g);
        Arrays.sort(s);
        int res = 0;
        int i = 0;
        int n = s.length;
        for (int c : g)
        {
            while (i < n && s[i] < c)
            {
                ++i;
            }
            if (i == n)
            {
                break;
            }
            ++res;
            ++i;
        }
        return res;
    }
}