learn/MinStack.java at master · romerolanguages/learn · GitHub

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
packagequestions.virendra;

publicclassMinStack {

Nodetop;

publicvoidpush(intx)
	{
if(top == null)
 {
top = newNode(x);
 }
else
 {
Nodetemp = newNode(x);
temp.next = top;
temp.min = Math.min(top.min, x);
top = temp;
 }
	}

publicvoidpop()
	{
if(top == null)
 {
System.out.println("Stack empty!");
return;
 }

top = top.next;
	}

publicinttop()
	{
if(top == null)
 {
System.out.println("Stack empty!");
returnInteger.MAX_VALUE;
 }

returntop.value;
	}

publicintmin()
	{
if(top == null)
 {
System.out.println("Stack empty!");
returnInteger.MAX_VALUE;
 }

returntop.min;

	}

publicstaticvoidmain(Stringargs[])
	{
MinStackmStack = newMinStack();
mStack.push(7);
mStack.push(8);
System.out.println(mStack.min());
mStack.push(5);
mStack.push(9);
System.out.println(mStack.min());
mStack.push(5);
mStack.push(2);
System.out.println(mStack.min());
mStack.pop();
mStack.pop();
System.out.println(mStack.min());
	}


}

classNode {
intvalue;
intmin;
Nodenext;

Node(intx)
	{
value = x;
next = null;
min = x;
	}
}