-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathMaxMinWindow.java
82 lines (64 loc) · 2.14 KB
/
MaxMinWindow.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
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
package Stack;
import java.util.Stack;
class MaxMinWindow
{
static int arr[] = {10, 20, 30, 50, 10, 70, 30};
static void printMaxOfMin(int n)
{
Stack<Integer> s = new Stack<>();
int left[] = new int[n+1];
int right[] = new int[n+1];
for (int i=0; i<n; i++)
{
left[i] = -1;
right[i] = n;
}
for (int i=0; i<n; i++)
{
while (!s.empty() && arr[s.peek()] >= arr[i])
s.pop();
if (!s.empty())
left[i] = s.peek();
s.push(i);
}
// Empty the stack as stack is going to be used for right[]
while (!s.empty())
s.pop();
// Fill elements of right[] using same logic
for (int i = n-1 ; i>=0 ; i-- )
{
while (!s.empty() && arr[s.peek()] >= arr[i])
s.pop();
if(!s.empty())
right[i] = s.peek();
s.push(i);
}
// Create and initialize answer array
int ans[] = new int[n+1];
for (int i=0; i<=n; i++)
ans[i] = 0;
// Fill answer array by comparing minimums of all
// lengths computed using left[] and right[]
for (int i=0; i<n; i++)
{
// length of the interval
int len = right[i] - left[i] - 1;
// arr[i] is a possible answer for this length
// 'len' interval, check if arr[i] is more than
// max for 'len'
ans[len] = Math.max(ans[len], arr[i]);
}
// Some entries in ans[] may not be filled yet. Fill
// them by taking values from right side of ans[]
for (int i=n-1; i>=1; i--)
ans[i] = Math.max(ans[i], ans[i+1]);
// Print the result
for (int i=1; i<=n; i++)
System.out.print(ans[i] + " ");
}
// Driver method
public static void main(String[] args)
{
printMaxOfMin(arr.length);
}
}