455分发饼干 class Solution: def findContentChildren(self, g: List[int], s: List[int]) -> int: ans = 0 i,j = 0,0 # 先排序 g.sort() s.sort() # 贪心算法,尽可能用最小的饼干去满足每一个小孩 while i<len(g) and j<len(s): if g[i] <= s[j]: i,j = i+1,j+1 ans += 1 else: j += 1 return ans