1class Solution:2 def maxDistance(self, n1: List[int], n2: List[int]) -> int:3 i = j = res = 04 while i < len(n1) and j < len(n2):5 if n1[i] > n2[j]:6 i += 17 else:8 res = max(res, j - i)9 j += 110 return res
WPM •0 •0
ACC •0 •0
TIME •0