首页 > 代码库 > Container With Most Water
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.
解题方案：
遍历所有方案，找到最大值。下面是该题的代码：
1 class Solution { 2 public: 3 int maxArea(vector<int> &height) { 4 int maxAre = 0; 5 int area = 0; 6 int len = height.size(); 7 int left = 0; 8 int right = len -1; 9 while(left < right){10 int high = height[left] > height[right]? height[right]:height[left];11 area = high * (right - left);12 if(area > maxAre){13 maxAre = area;14 }else if(height[left] > height[right]){15 right--;16 }else {17 left++;18 }19 20 }21 return maxAre;22 }23 };
Container With Most Water
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。