-
Notifications
You must be signed in to change notification settings - Fork 67
/
Copy pathArrayBasedStack.java
103 lines (91 loc) · 2.2 KB
/
ArrayBasedStack.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
/**
* Data-Structures-in-Java
* ArrayBasedStack.java
*/
package com.deepak.data.structures.Stack;
import java.util.NoSuchElementException;
/**
* Class implementing Stack based on Array
*/
public class ArrayBasedStack {
/**
* Sample implementation of stack
* @param args
*/
public static void main(String[] args) {
ArrayBasedStack stack = new ArrayBasedStack(5);
System.out.println("Creating a fresh Stack");
System.out.println("Size of Stack => " + stack.size());
System.out.println("Is Stack Empty => " + stack.isEmpty());
System.out.println("Inserting two items in Stack.");
stack.push(10);
stack.push(20);
System.out.println("After Insertion, Size of Stack => " + stack.size());
System.out.println("After Insertion, Is Stack Empty => " + stack.isEmpty());
System.out.println("Removing an item from Stack.");
stack.pop();
System.out.println("After Removal, Size of Stack => " + stack.size());
System.out.println("Top element on Stack => " + stack.peek());
}
/**
* Array of objects representing Stack
*/
private Object[] array;
/**
* Size of Stack
*/
private int size = 0;
/**
* Constructor to create a new Stack
* @param capacity
*/
public ArrayBasedStack(int capacity) {
array = new Object[capacity];
}
/**
* Method to push a item on top of stack
* @param item
*/
public void push(Object item) {
if (size == array.length) {
throw new IllegalStateException("Cannot insert on full Stack");
}
array[size++] = item;
}
/**
* Method to remove a item from top of stack
* @return {@link Object}
*/
public Object pop() {
if (size == 0) {
throw new NoSuchElementException("Cannot delete from a empty Stack");
}
Object result = array[size - 1];
array[size--] = null;
return result;
}
/**
* Method to look up top item in stack
* @return {@link Object}
*/
public Object peek() {
if (size == 0) {
throw new NoSuchElementException("Cannot peek from a empty Stack");
}
return array[size - 1];
}
/**
* Method to check size of the stack
* @return {@link int}
*/
public int size() {
return size;
}
/**
* Method to check if stack is empty
* @return {@link boolean}
*/
public boolean isEmpty() {
return size == 0;
}
}