题目 题解 思路:每个孩子给满足条件的最小的饼干 class Solution: def findContentChildren(self, g: List[int], s: List[int]) -> int: g.sort() s.sort() i = j = count = 0 while i < len(g) and j < len(s): if g[i] <= s[j]: count += 1 i += 1 #满足条件才移动一格 j += 1 #不管有没有满足条件,都要移动一格:满足了就换下一块给新孩子,不满足就要换更大一块 return count