(LeetCode) 11. Container With Most Water

文章目录

  1. 1. Original URL: 11. Container With Most Water
  2. 2. My solutions:
    1. 2.1. With C++:

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.

Difficulty: Medium
Tags: Array, Two Pointers

Original URL: 11. Container With Most Water

My solutions:

With C++:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
public:
int maxArea(vector<int>& height) {
int len = height.size();
int max = 0, i = 0, j = len-1;
while(i < len && j > i)
{
if(height[i] <= height[j])
{
max = (max >= (j-i)*height[i]) ? max : (j-i)*height[i];
i++;
}
else
{
max = (max >= (j-i)*height[j]) ? max : (j-i)*height[j];
j--;
}
}
return max;
}
};

See my 30+ solutions of LeetCode on GitHub