分发饼干

Python

class Solution(object):
    def findContentChildren(self, g, s):
        """
        :type g: List[int]
        :type s: List[int]
        :rtype: int
        """
        g.sort()
        s.sort()
        count = 0
        i, j = 0, 0
        while i < len(g) and j < len(s):
            while j < len(s) and s[j] < g[i]: count += 1
            if j < len(s): count += 1
            i += 1
            j += 1
        return count