forked from larissalages/code_problems
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathContainerWithMostWater.java
More file actions
38 lines (31 loc) · 1.27 KB
/
ContainerWithMostWater.java
File metadata and controls
38 lines (31 loc) · 1.27 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
// Leetcode - 11 - ContainerWithMostWater.java
/**
* 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 and n is at least 2.
The above vertical lines are represented by array [1,8,6,2,5,4,8,3,7]. In this case, the max area of water (blue section) the container can contain is 49.
Example:
Input: [1,8,6,2,5,4,8,3,7]
Output: 49
*/
public class ContainerWithMostWater {
class Solution {
public int maxArea(int[] height) {
if (height == null || height.length == 0) {
return 0;
}
int i = 0;
int j = height.length - 1;
int area = Integer.MIN_VALUE;
while(i < j) {
int minHeight = Math.min(height[i], height[j]);
area = Math.max(area, minHeight*(j - i));
if(height[i] < height[j]) {
i++;
} else {
j--;
}
}
return area;
}
}
}