Leetcode | 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.

暴力超时。网上的算法，左右两指针。。。

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