-
Notifications
You must be signed in to change notification settings - Fork 124
Expand file tree
/
Copy pathMainClass.java
More file actions
148 lines (124 loc) · 3 KB
/
MainClass.java
File metadata and controls
148 lines (124 loc) · 3 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
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
package stackProblems2;
import java.util.ArrayDeque;
public class MainClass {
static int[] previousSmaller(int a[]) {
int ans[] = new int[a.length];
ArrayDeque<Integer> stack = new ArrayDeque<>();
for(int i = 0; i<a.length; i++) {
int e = a[i];
while(!stack.isEmpty() && a[stack.peek()] >= e) {
stack.pop();
}
if(stack.isEmpty()) {
ans[i] = -1;
} else {
ans[i] = stack.peek();
}
stack.push(i);
}
return ans;
}
static int[] nextSmaller(int a[]) {
int ans[] = new int[a.length];
ArrayDeque<Integer> stack = new ArrayDeque<>();
for(int i = a.length-1; i>=0; i--) {
int e = a[i];
while(!stack.isEmpty() && a[stack.peek()] >= e) {
stack.pop();
}
if(stack.isEmpty()) {
ans[i] = a.length;
} else {
ans[i] = stack.peek();
}
stack.push(i);
}
return ans;
}
static int maxmaximumAreaInHistogramOptimised(int a[]) {
int ps[] = previousSmaller(a);
int ns[] = nextSmaller(a);
int max = 0;
for(int i = 0; i<a.length; i++) {
int width = ns[i]-ps[i]-1;
int curArea = width * a[i];
max = Math.max(max, curArea);
}
return max;
}
static int maximumAreaInHistogram(int a[]) {
int n = a.length;
int max = 0;
for(int i = 0; i<n; i++) {
int l = i, r = i;
while(l >= 0 && a[l] >= a[i]) l--;
while(r < n && a[r] >= a[i]) r++;
int width = r-l-1;
int curArea = a[i] * width;
max = Math.max(max, curArea);
}
return max;
}
static int maximumAreaSubMatrix(int a[][]) {
int b[] = new int[a[0].length];
int max = 0;
for(int i = 0; i<a.length; i++) {
for(int j = 0; j<b.length; j++) {
if(a[i][j] == 0) {
b[j] = 0;
} else {
b[j]++;
}
}
int cur = maxmaximumAreaInHistogramOptimised(b);
max = Math.max(max, cur);
}
return max;
}
public static void main(String[] args) throws Exception {
MinStack minStack = new MinStack();
minStack.push(10);
minStack.push(2);
System.out.println(minStack.min());
minStack.push(1);
System.out.println(minStack.min());
minStack.pop();
minStack.push(5);
System.out.println(minStack.min());
minStack.pop();
System.out.println(minStack.min());
minStack.push(2);
System.out.println(minStack.min());
minStack.push(10);
System.out.println(minStack.min());
// int a[][] = {
// {1, 1, 0, 1},
// {1, 1, 0, 1},
// {0, 0, 1, 1},
// {1, 1, 0, 0}
// };
// System.out.println(maximumAreaSubMatrix(a));
// int a[] = {4, 3, 9, 2, 5, 1, 8, 3};
//
// System.out.println(maximumAreaInHistogram(a));
// System.out.println(maxmaximumAreaInHistogramOptimised(a));
//
// int a[] = {4, 2, 1, 4, 3, 0, 2, 3};
// System.out.println(maximumAreaInHistogram(a));
// TwoStacks obj = new TwoStacks(5);
// obj.push1(10);
// obj.push1(20);
// obj.push1(30);
//
// obj.push2(40);
// obj.push2(60);
//
// System.out.println(obj.pop1());
// System.out.println(obj.pop1());
//
// System.out.println(obj.pop2());
// System.out.println(obj.pop2());
//
// System.out.println(obj.pop2());
}
}