【LeetCode】LeetCode——第11题：Container With Most Water

11. Container With Most Water

    My Submissions

Question Editorial Solution

Total Accepted: 75667  Total Submissions: 219100  Difficulty: Medium

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.

Subscribe to see which companies asked this question

Show Tags

Show Similar Problems

题目的大概意思是：给定一些挡板，取两个挡板使得蓄水量最大，并输出最大蓄水量。当然，蓄水的高度由两个挡板中较小者决定。

这道题难度等级：中等

看到这个题的第一反应就是用双指针法，即l、r往中间靠拢，这里的中间是泛指。

代码如下：

class Solution {
public:
    int maxArea(vector<int>& height) {
		int l = 0, r = height.size() - 1;
		int max_Area = 0;
		while (l < r){
			max_Area = max(max_Area, (r - l) * min(height[l], height[r]));
			height[l] > height[r] ? (r--) : (l++);
		}
		return max_Area;
    }
};

提交代码后顺利AC掉，Runtime: 24 ms。