LeetCode #11 Container With Most Water

Description

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.

---

Analysis

题目难度为：Medium
思路比较简单，从相距最远的木板开始计算容积，当距离缩短，只有更高的木板才能是容积更大

---

Code（c++)

class Solution {public:    int maxArea(vector<int>& height) {        int water = 0, h;        int i = 0, j = height.size() - 1;        while (i < j) {            if (height[i] < height[j]) {                h = height[i];                if (water < (j - i) * h) water = (j - i) * h;                while (height[i] <= h) ++i;            }            else {                h = height[j];                if (water < (j - i) * h) water = (j - i) * h;                while (height[j] <= h) --j;            }        }    return water;    }};