FilesExpand file tree

 master

/

StackArrayList.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

97 lines (83 loc) · 2.44 KB

 master

/

StackArrayList.java

Copy path

Top

File metadata and controls

• Code
• Blame

97 lines (83 loc) · 2.44 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

package DataStructures.Stacks;

import java.util.ArrayList;

/**

* This class implements a Stack using an ArrayList.

* <p>

* A stack is exactly what it sounds like. An element gets added to the top of

* the stack and only the element on the top may be removed.

* <p>

* This is an ArrayList Implementation of a stack, where size is not

* a problem we can extend the stack as much as we want.

*

* @author Unknown

*/

public class StackArrayList {

/**

* Main method

*

* @param args Command line arguments

*/

public static void main(String[] args) {

StackArrayList myStackArrayList = new StackArrayList();

myStackArrayList.push(5);

myStackArrayList.push(8);

myStackArrayList.push(2);

myStackArrayList.push(9);

System.out.println("*********************Stack List Implementation*********************");

System.out.println(myStackArrayList.isEmpty()); // will print false

System.out.println(myStackArrayList.peek()); // will print 9

System.out.println(myStackArrayList.pop()); // will print 9

System.out.println(myStackArrayList.peek()); // will print 2

System.out.println(myStackArrayList.pop()); // will print 2

}

/**

* ArrayList representation of the stack

*/

private ArrayList<Integer> stackList;

/**

* Constructor

*/

public StackArrayList() {

stackList = new ArrayList<>();

}

/**

* Adds value to the end of list which

* is the top for stack

*

* @param value value to be added

*/

public void push(int value) {

stackList.add(value);

}

/**

* Pops last element of list which is indeed

* the top for Stack

*

* @return Element popped

*/

public int pop() {

if (!isEmpty()) { // checks for an empty Stack

int popValue = stackList.get(stackList.size() - 1);

stackList.remove(stackList.size() - 1); // removes the poped element from the list

return popValue;

}

System.out.print("The stack is already empty!");

return -1;

}

/**

* Checks for empty Stack

*

* @return true if stack is empty

*/

public boolean isEmpty() {

return stackList.isEmpty();

}

/**

* Top element of stack

*

* @return top element of stack

*/

public int peek() {

return stackList.get(stackList.size() - 1);

}

}