-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMinimumNumber.java
More file actions
61 lines (55 loc) · 1.5 KB
/
Copy pathMinimumNumber.java
File metadata and controls
61 lines (55 loc) · 1.5 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
public class MinimumNumber {
static class Stack{
int maxsize;
int stackArray[];
int top;
Stack(int size){
maxsize= size;
stackArray= new int[maxsize];
top= -1;
}
void push(int val){
if(top==maxsize-1){
System.out.println("Stack overflow");
return;
}
stackArray[++top]= val;
System.out.println(val + " pushed into stack");
}
void display(){
if(top==-1){
System.out.println("Empty stack");
return;
}
for(int i=0; i<=top; i++){
System.out.print(stackArray[i] + " ");
}
System.out.println();
}
void minimumValue(){
if(top==-1){
System.out.println("Empty stack");
return;
}
int minValue=stackArray[0];
int minIndex= 0;
for(int i=1; i<=top; i++){
if(stackArray[i]<minValue){
minValue= stackArray[i];
minIndex= i;
}
}
System.out.println(minValue + " is maximum found at index " + minIndex);
}
}
public static void main(String[] args) {
Stack st= new Stack(5);
st.push(35);
st.push(23);
st.push(43);
st.push(75);
st.push(53);
st.display();
st.minimumValue();
}
}