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

解法

int maxArea(vector<int>& height) {
        int num = height.size();
        int area = 0;
        //https://leetcode.com/discuss/41527/simple-and-fast-c-c-with-explanation
        int i=0,j=num-1;
        while(i<j){
            int h = min(height[i],height[j]);
            area = max(area,h*(j-i));
            while(height[i]<=h && i<j) i++;
            while(height[j]<=h && i<j) j--;
        }

        return area;
    }