1class Solution:2 def maxArea(self, H: List[int]) -> int:3 ans, i, j = 0, 0, len(H) - 14 while i < j:5 if H[i] <= H[j]:6 res = H[i] * (j - i)7 i += 18 else:9 res = H[j] * (j - i)10 j -= 111 if res > ans:12 ans = res13 return ans
WPM •0 •0
ACC •0 •0
TIME •0