-
Notifications
You must be signed in to change notification settings - Fork 2
/
ContainerWithMostWater.java
62 lines (57 loc) · 1.53 KB
/
ContainerWithMostWater.java
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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
package Leetcode;
/**
* @author kalpak
*
* 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 the line i is at (i, ai) and (i, 0).
*
* Find two lines, which, together with the x-axis forms a container, such that the container contains the most water.
*
* Notice that you may not slant the container.
*
* Example 1:
* Input: height = [1,8,6,2,5,4,8,3,7]
* Output: 49
* Explanation: 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 2:
* Input: height = [1,1]
* Output: 1
*
* Example 3:
* Input: height = [4,3,2,1,4]
* Output: 16
*
* Example 4:
* Input: height = [1,2,1]
* Output: 2
*
* Constraints:
*
* n == height.length
* 2 <= n <= 3 * 104
* 0 <= height[i] <= 3 * 104
*
*/
public class ContainerWithMostWater {
public static int maxArea(int[] height) {
int result = 0;
int low = 0;
int high = height.length - 1;
int temp = 0;
while(low < high)
{
temp = (high - low)*Math.min(height[low], height[high]);
result = Math.max(temp, result);
if (height[low] < height[high])
low++;
else
high--;
}
return result;
}
public static void main(String[] args) {
int[] arr = new int[]{1,8,6,2,5,4,8,3,7};
System.out.println(maxArea(arr));
}
}