repl.it
@ABHISHEKAREER/

stack using array in java (datastructure)

Java

No description

fork
loading
Files
  • Main.java
Main.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
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
/*import java.util.*;
import java.io.*;
class Stack
{
    static final int max=10;
    int arr[]=new int [max];
    int top;
    Stack()
    {
        top=-1;
    }
    public void push(int data)
    {
        if(top==max-1)
        {
            System.out.println("stack is full !");
        }
        else
        {
            top++;
            arr[top]=data;
        }
    }
    public int pop()
    {
        if(top==-1)
        {
            System.out.println("stack is empty !");
            return -999;
        }
        else
        {
          int data=arr[top];
          top--;
          return data;
        }
    }
    public int peek()
    {
      if(top==-1)
      {
        System.out.println("stack is empty");
        return -999;
      }
      else
      {
        return arr[top];
      }
    }
    public void traverse()
    {
      if(top==-1)
      {
        System.out.println("stack is empty ");
      }
      else
      {
        System.out.println()
      }
    }
}
class Main {
  public static void main(String[] args) {
    Stack ss=new Stack();
    ss.push(10);
    ss.push(20);
    ss.push(30);
    ss.push(40);
    System.out.println(ss.pop());
  }
}*/
//CHAR Stack below and above is int stack in array
import java.util.*;
import java.io.*;
import java.lang.*;
class Stack
{
    static final char max=10;
    char arr[]=new char [max];
    int top;
    Stack()
    {
        top=-1;
    }
    public void push(char data)
    {
        if(top==max-1)
        {
            System.out.println("stack is full !");
        }
        else
        {
            top++;
            arr[top]=data;
        }
    }
    public char pop()
    {
        if(top==-1)
        {
            System.out.println("stack is empty ");
            return '!';
        }
        else
        {
          char data=arr[top];
          top--;
          return data;
        }
    }
    public char peek()
    {
      if(top==-1)
      {
        System.out.println("stack is empty");
        return '!';
      }
      else
      {
        return arr[top];
      }
    }
    public void traverse()
    {
      if(top==-1)
      {
        System.out.println("stack is empty ");
      }
      else
      {
        for(int i=top;i>=0;i--)
        {
          System.out.println(arr[i]);
        }
      }
    }
}
class Main {
  public static void main(String[] args) {
    System.out.println("enter the String :-");
    Scanner sc= new Scanner(System.in);
    Stack ss=new Stack();
    String str=sc.nextLine();
    for(int i=0;i<str.length();i++){
      ss.push(str.charAt(i));
    }
    char ch = ss.pop();
    while(ch!='!')
    {
      System.out.println(ch);
      ch=ss.pop();
    }
  }
}
Fetching token
?