mirror of
https://github.com/TheAlgorithms/Java.git
synced 2025-07-20 18:24:49 +08:00

checkstyle: fix typos, style Co-authored-by: alxkm <alx@alx.com> Co-authored-by: Piotr Idzik <65706193+vil02@users.noreply.github.com>
39 lines
1.1 KiB
Java
39 lines
1.1 KiB
Java
package com.thealgorithms.stacks;
|
|
|
|
import java.util.Stack;
|
|
|
|
/**
|
|
*
|
|
* @author mohd rameez github.com/rameez471
|
|
*/
|
|
|
|
public final class LargestRectangle {
|
|
private LargestRectangle() {
|
|
}
|
|
|
|
public static String largestRectangleHistogram(int[] heights) {
|
|
int n = heights.length;
|
|
int maxArea = 0;
|
|
Stack<int[]> st = new Stack<>();
|
|
for (int i = 0; i < n; i++) {
|
|
int start = i;
|
|
while (!st.isEmpty() && st.peek()[1] > heights[i]) {
|
|
int[] tmp = st.pop();
|
|
maxArea = Math.max(maxArea, tmp[1] * (i - tmp[0]));
|
|
start = tmp[0];
|
|
}
|
|
st.push(new int[] {start, heights[i]});
|
|
}
|
|
while (!st.isEmpty()) {
|
|
int[] tmp = st.pop();
|
|
maxArea = Math.max(maxArea, tmp[1] * (n - tmp[0]));
|
|
}
|
|
return Integer.toString(maxArea);
|
|
}
|
|
|
|
public static void main(String[] args) {
|
|
assert largestRectangleHistogram(new int[] {2, 1, 5, 6, 2, 3}).equals("10");
|
|
assert largestRectangleHistogram(new int[] {2, 4}).equals("4");
|
|
}
|
|
}
|