-
Notifications
You must be signed in to change notification settings - Fork 66
/
Copy pathSimpleStackFromList.java
66 lines (57 loc) · 1 KB
/
SimpleStackFromList.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
/**
* Data-Structures-In-Java
* SimpleStackFromList.java
*/
package com.deepak.data.structures.Stack;
import java.util.LinkedList;
/**
* Class implementing simple stack based on the list
*
* @author Deepak
*/
public class SimpleStackFromList {
/**
* Linked list to hold items
*/
private LinkedList<Object> list = new LinkedList<>();
/**
* Method to push a item on top of stack
*
* @param item
*/
public void push(Object item) {
list.addFirst(item);
}
/**
* Method to remove a item from top of stack
*
* @return {@link Object}
*/
public Object pop() {
return list.removeFirst();
}
/**
* Method to look up top item in stack
*
* @return {@link Object}
*/
public Object peek() {
return list.getFirst();
}
/**
* Method to check size of the stack
*
* @return {@link int}
*/
public int size() {
return list.size();
}
/**
* Method to check if stack is empty
*
* @return {@link boolean}
*/
public boolean isEmpty() {
return list.isEmpty();
}
}