11. Container With Most Water

Given n non-negative integers a1, a2, ..., an , where each represents a point at coordinate (i, ai). n vertical lines are drawn such that the two endpoints of line i is at (i, ai) and (i, 0). Find two lines, which together with x-axis forms a container, such that the container contains the most water.

Note: You may not slant the container and n is at least 2.

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

 1 class Solution {
 2     public int maxArea(int[] height) {
 3         int l = 0, r = height.length - 1;
 4         int ans = 0;
 5         while (l < r) {
 6             int temp = Math.min(height[l], height[r]) * (r - l);
 7             ans = Math.max(ans, temp);
 8             if (height[l] < height[r]) l++;
 9             else r--;
10         }
11         return ans;
12     }
13 }

11. Container With Most Water

原文：https://www.cnblogs.com/hyxsolitude/p/12298074.html