Container with the 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.

Difficulty:Medium

Category:Math

Analyze

只需要定义i和j两个指针分别指向数组的左右两端，然后两个指针向中间搜索，每移动一次算一个值并和之前的结果比较取较大值. (ps.容器装水量: 是找出左右两个边缘中较小的那个乘以两边缘的距离)

Solution

class Solution {
 public:
  int maxArea(vector<int>& height) {
    int res = 0, i = 0, j = height.size() - 1;
    while (i < j) {
      res = max(res, (min(height[i], height[j])) * (j - i));
      height[i] > height[j] ? --j : ++i;
    }
    return res;
  }
};