011. Container With Most Water [Medium]

题目：
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.

柳神代码：
class Solution {
public:
int maxArea(vector<int>& height) {
int left = 0, right = height.size() - 1, area = 0;
while(left < right) {
area = max(area, min(height[left], height[right]) * (right
 1. left));
if(height[left] < height[right])
left++;
else
right--;
}
return area;
}
}

【心得】
1.求最值
（暴力遍历for 一一比较更新最值）
（非暴力遍历 设置初值 ——下一步往可能更大的情况跳 while）
2. 双指针 配合 while 遍历
while（left < right ){…left++ / right–… }