text: class Solution:
      def findContentChildren(self, g: List[int], s: List[int]) -> int:
          if not g or not s:
              return 0
          g.sort()
          s.sort()
          i = 0
          j = 0
          res = 0
          while i < len(g) and j < len(s):
              if s[j] >= g[i]:
                  res += 1
                  i += 1
                  j += 1
              elif s[j] < g[i]:
                  j += 1
          return res