Container With Most Water

Container With Most Water

Given n non-negative integers a₁, a₂, ...,a_n, where each represents a point at coordinate (i, a_i). n vertical lines are drawn such that the two endpoints of linei is at (i, a_i) 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.

 

解题方法：

题目大意，给出高度数组，求出数组间两个高度之间的最大盛水量！！

Code:

class Solution {public:    int maxArea(vector<int> &height){int capablity=0;int low=0;int high=height.size()-1;while(low<high){int tempSum=min(height[low],height[high])*(high-low);if(tempSum>capablity)capablity=tempSum;if(height[low]<height[high])low++;elsehigh--;}return capablity;}};