首页 > 代码库 > 【LeetCode】Container With Most Water
【LeetCode】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.
双指针，思路与Trapping Rain Water类似。
数值小的指针往中间逼近。
复杂度O(n)。
class Solution {public: int maxArea(vector<int> &height) { if(height.empty() || height.size() == 1) return 0; int result = 0; int left = 0; int right = height.size()-1; int leftWall = height[left]; int rightWall = height[right]; while(left < right) { result = max(result, min(leftWall, rightWall) * (right-left)); if(leftWall <= rightWall) { left ++; leftWall = height[left]; } else { right --; rightWall = height[right]; } } return result; }};
【LeetCode】Container With Most Water
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。