455. Assign Cookies

455. Assign Cookies

Easy

1409157Add to ListShare

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 g[i], which is the minimum size of a cookie that the child will be content with; and each cookie j has a size s[j]. If s[j] >= g[i], 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.

Example 1:

Input: g = [1,2,3], s = [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: g = [1,2], s = [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.

Constraints:

• 1 <= g.length <= 3 * 104
• 0 <= s.length <= 3 * 104
• 1 <= g[i], s[j] <= 231 - 1

class Solution:
    def findContentChildren(self, g: List[int], s: List[int]) -> int:
        """
        assert Solution().findContentChildren([1, 2], [1, 2, 3]) == 2
        assert Solution().findContentChildren([1, 2, 3], [1, 1]) == 1
        解题思路：贪心，尽量让糖果给最大要求的孩子
        2个数组分别排序，然后从最小的开始枚举每个孩子的满意度，另一个数组维护一个索引不断挑符合条件的糖果
        时间复杂度：nlogn，其中 n = max(size(g),size(s)
        """
        g.sort()
        s.sort()
        # 我的代码：
        # s_index = 0
        # result = 0
        # for c in g:
        #     # 枚举每个孩子满意度
        #     while s_index < len(s):
        #         if c <= s[s_index]:
        #             # 找到满意的糖果
        #             s_index += 1
        #             result += 1
        #             break
        #         s_index += 1
        #     if s_index >= len(s):
        #         break
        # return result
        # 参考别人的写法：
        child = cookies = 0
        while child < len(g) and cookies < len(s):
            if g[child] <= s[cookies]:
                child += 1
            cookies += 1
        return child