-
Notifications
You must be signed in to change notification settings - Fork 15
Expand file tree
/
Copy pathkLargestEleS.java
More file actions
59 lines (48 loc) · 1.38 KB
/
kLargestEleS.java
File metadata and controls
59 lines (48 loc) · 1.38 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
import java.util.*;
import java.util.Stack;
public class kLargestEleS {
public static Stack <Integer> sortStack(Stack <Integer> input)
{
Stack<Integer> tempStack=new Stack<Integer>();
while(!input.isEmpty())
{
int value=input.pop();
while(!tempStack.isEmpty() && value<tempStack.peek())
{
int tempValue=tempStack.pop();
input.push(tempValue);
}
tempStack.push(value);
}
return tempStack;
}
public static void findKthLargestNum(Stack <Integer> sortedStack, int k)
{
int i=1;
while(i<k)
{
sortedStack.pop();
i++;
}
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);
}
Stack < Integer > temp = sortStack(inputStack);
findKthLargestNum(temp, k);
}
}