LeetCod题目：Container With Most Water

题目地址：点击打开链接

题目描述：

Given n non-negative integers a₁,a₂, ..., a_n, where each represents a point at coordinate (i,a_i). n vertical lines are drawn such that the two endpoints of linei is at (i, a_i) 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.

Subscribe to see which companies asked this question.

代码：

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