Leetcode array 11. Container With Most Water

版权声明：本文为博主原创文章，未经博主允许不得转载。 https://blog.csdn.net/owenfy/article/details/86621066

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

#include<bits/stdc++.h>

using namespace std;

int maxArea(vector<int>& height)
{
        int max = 0;
        for(int i = 0;i<height.size()-1;i++)
        {
                for(int j = i+1;j<height.size();j++)
                {
                        int area = (j-i)*min<int>(height[j],height[i]);
                        if(area > max)
                                max = area;

                }
        }

        return max;
}

int main()
{
        vector<int> a;
        int i = 0;
        do
        {
                cin>>i;
                a.push_back(i);
        }while(getchar()!='\n');

        int ans = maxArea(a);
        cout<<ans<<endl;
}

收获：比较大小

min<int>(height[j],height[i])