11. 盛最多水的容器（LeetCode记录）

Posted 2022-12-16 唐 昊

 public int maxArea(int[] a) 
		 int max = 0;
		 for(int i = 0, j = a.length - 1; i < j ;)
			 int minHeight = a[i] < a[j] ? a[i ++] : a[j --];
			 max = Math.max(max, (j - i + 1) * minHeight);
		 
		 return max;