1题目描述
2.代码构思(debug)
双指针
class Solution:
def maxArea(self, nums: List[int]) -> int:
if not nums:
return
left = 0
right = len(nums) - 1
maxnum = -9999999
while left <= right:
maxnum = max(maxnum,min(nums[left],nums[right])*(right - left))
if nums[left] > nums[right]:
right -= 1
else:
left += 1
return maxnum