Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
56 lines (42 loc) · 1.62 KB

File metadata and controls

56 lines (42 loc) · 1.62 KB
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package Algorithms;
import java.util.Stack;
public class Rectangle {
public static void main(String[] args){
int[] input = {4,2,0,3,2,5};
int result = largestRectangleArea(input);
System.out.printf("Result: %d\n", result);
}
public static int largestRectangleArea(int[] height) {
if (height == null || height.length == 0){
return 0;
}
Stack<Integer> stack = new Stack<Integer>();
int rightBoard = 0;
int maxArea = 0;
stack.push(rightBoard);
for (rightBoard = 1; rightBoard <= height.length; rightBoard ++){
int leftBoard;
int h;
int wide;
int currentHeight = 0;
if (rightBoard < height.length){
currentHeight = height[rightBoard];
}
while (!stack.empty() && currentHeight < height[stack.peek()]){
/* get the left board of the rectangle. */
leftBoard = stack.pop();
h = height[leftBoard];
if (stack.empty()){
wide = rightBoard;
}else{
//wide = rightBoard - leftBoard;
wide = rightBoard - stack.peek() -1;
}
System.out.printf("area: %d, h:%d, w:%d\n", h*wide, h, wide);
maxArea = Math.max(maxArea, h*wide);
}
stack.push(rightBoard);
}
return maxArea;
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.