LeetCode-11-Container With Most Water

标签：example   cto   repr   暴力   contains   axis   present   where   res   

算法描述：

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

The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.

Example:

Input: [1,8,6,2,5,4,8,3,7]
Output: 49

解题思路：

用暴力法可以直接解决，此外用双指针方式也可以解决。

int maxArea(vector<int>& height) {
        int left = 0; int right = height.size()-1;
        int maxArea = 0;
        while(left < right){
            int h = min(height[left],height[right]);
            int w = right - left;
            maxArea = max(maxArea,h*w);
            if(height[left] < height[right]) left++;
            else right--;
        }
        return maxArea;
    }

LeetCode-11-Container With Most Water

标签：example   cto   repr   暴力   contains   axis   present   where   res   

原文地址：https://www.cnblogs.com/nobodywang/p/10314655.html