455. Assign Cookies

Tags: [sort]

Link: https://leetcode.com/problems/assign-cookies/?tab=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.

Solution: sort

class Solution(object):
    def findContentChildren(self, g, s):
        """
        :type g: List[int]
        :type s: List[int]
        :rtype: int
        """
        if not g or not s:
            return 0

        g.sort()
        s.sort()

        g_index = len(g) - 1
        s_index = len(s) - 1

        counter = 0
        while g_index >= 0 and s_index >= 0:
            if s[s_index] >= g[g_index]:
                s_index -= 1
                counter += 1

            g_index -= 1

        return counter

Note:

• Time complexity = O(max(nlgn, mlgm)), n is the number of the elements of the g, and the m is the number of the elements of the s.