def get_max_volumn(nums):
left_index, right_index = 0, len(nums) - 1
max_volumn = 0
while left_index < right_index:
max_volumn = max(max_volumn, min(nums[left_index], nums[right_index]) * (right_index - left_index))
if nums[left_index] < nums[right_index]:
left_index += 1
else:
right_index -= 1
return max_volumn
盛水容器 双指针
最新推荐文章于 2023-09-26 21:17:00 发布