[leetcode] Container With Most Water

FROM : https://leetcode.com/problems/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 max=0, a=0, b=height.size()-1;        while(a < b) {            int area = (b-a)*min(height[a], height[b]);            if(area > max) max = area;            height[a]>height[b] ? b-- : a++;        }        return max;    }};