g0001_0100.s0011_container_with_most_water.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
package g0001_0100.s0011_container_with_most_water;
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #Array #Greedy #Two_Pointers
public class Solution {
public int maxArea(int[] height) {
int maxArea = -1;
int left = 0;
int right = height.length - 1;
while (left < right) {
if (height[left] < height[right]) {
maxArea = Math.max(maxArea, height[left] * (right - left));
left++;
} else {
maxArea = Math.max(maxArea, height[right] * (right - left));
right--;
}
}
return maxArea;
}
}