-
Notifications
You must be signed in to change notification settings - Fork 0
/
Find the kth Largest Element.java
59 lines (47 loc) · 1.64 KB
/
Find the kth Largest Element.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
import java.util.*;
public class Source {
// This function returns the sorted stack
public static Stack < Integer > sortStack(Stack < Integer > input) {
Stack <Integer> temp = new Stack <>();
while (!input.isEmpty()) {
// pop out the top element in stack
int value = input.pop();
// while temporary stack is not empty and value of the top element of input stack is less than the value of the top element of temp stack
while (!temp.isEmpty() && value < temp.peek()) {
// pop the last element from temporary stack and push it to the input stack
input.push(temp.pop());
}
// push value in the temp stack
temp.push(value);
}
return temp;
}
public static void findKthLargestNum(Stack <Integer> sortedStack, int k) {
int j = 1;
while (j < k) {
sortedStack.pop();
j++;
}
System.out.println(sortedStack.peek());
}
public static void main(String args[]) {
Stack < Integer > inputStack = new Stack < Integer > ();
Scanner in = new Scanner(System.in);
int n = in .nextInt();
for (int i = 0; i < n; i++) {
inputStack.add( in .nextInt());
}
if (inputStack.isEmpty()) {
System.out.println("stack is empty");
System.exit(0);
}
int k = in .nextInt();
if (k > inputStack.size()) {
System.out.println("invalid input");
System.exit(0);
}
// This is the temporary stack
Stack < Integer > temp = sortStack(inputStack);
findKthLargestNum(temp, k);
}
}