MazeSolver/MyStack.java at main · vingupta22/MazeSolver · 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
import java.util.EmptyStackException;

public class MyStack
{
   private Square[] stack;
   private int size;
   public MyStack()
   {
      stack = new Square[10];
      size = 0;
   }

   public MyStack(int initCap)
   {
      stack = new Square[initCap];
      size = 0;
   }

   public boolean isEmpty()
   {
      if(size == 0)
         return true;
      return false;
   }

   public Square peek()
   {
      if(size <= 0)
         throw new EmptyStackException();
      else
         return stack[size-1];
   }

   public Square pop()
   {
      if(size <= 0)
         throw new EmptyStackException();
      else
      {
         Square i = stack[size-1];
         size--;
         return i;
      }
   }

   public void push(Square item)
   {
      if(size+1 >= stack.length)
      {
         doubleCapacity();
         stack[size] = item;
         size++;
      }
      else{
         stack[size] = item;
         size++;
      }

   }

   private void doubleCapacity()
   {
      Square[] temp = new Square[stack.length*2];
      for(int i = 0; i < size; i++)
      {
         temp[i] = stack[i];
      }
      stack = temp;

   }

   public String toString()
   {
      String ret = "";
      for(int i = 0; i < size; i++)
      {
         ret+= (stack[i] + ", ");
      }
      return ret.substring(0, ret.length()-2);
   }


}