FilesExpand file tree

 master

/

TheStack.java

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

142 lines (111 loc) · 3.44 KB

 master

/

TheStack.java

Copy path

Top

File metadata and controls

• Code
• Blame

142 lines (111 loc) · 3.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

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

/*PROJECT:

*AUTHOR: $(user)

*DESCRIPTION:

*****************************************************************************/

package thestack;

import java.util.Arrays;

public class TheStack {

private String[] stackArray;

private int stackSize;

private int topOfStack;

TheStack(int size) {

stackArray = new String[size];

stackSize = size;

//Assign -1 to every value

//to control what gets printed

Arrays.fill(stackArray, "-1");

}

public void push(String input) {

if (topOfStack + 1 < stackSize) {

topOfStack++;

stackArray[topOfStack] = input;

} else {

System.out.println("Stack is full\n");

}

displayTheStack();

System.out.println("PUSH: " + input + " Was added to the Stack\n");

}

public String pop() {

if (topOfStack >= 0) {

displayTheStack();

System.out.println("POP: " + stackArray[topOfStack] + " "

+ "Was removed from the Stack\n");

stackArray[topOfStack] = "-1";

return stackArray[topOfStack--];

} else {

displayTheStack();

System.out.println("Sorry but the Stack is empty\n");

return "-1";

}

}

public String peek() {

displayTheStack();

System.out.println("PEEK: " + stackArray[topOfStack] + " "

+ "Is at the top of the Stack \n");

return stackArray[topOfStack];

}

public void pushMany(String multipleValues) {

String[] tempString = multipleValues.split(" ");

for (int i = 0; i < tempString.length; i++) {

push(tempString[i]);

}

}

public void popAll() {

for (int i = 0; i < topOfStack; i++) {

pop();

}

}

public void popDisplayAll() {

String theReverse = "";

for (int i = topOfStack; i >= 0; i--) {

theReverse += stackArray[i];

}

System.out.println("The reverse: " + theReverse);

popAll();

}

public void displayTheStack() {

for (int n = 0; n < 61; n++) {

System.out.print("-");

}

System.out.println();

for (int n = 0; n < stackSize; n++) {

System.out.format("| %2s " + " ", n);

}

System.out.println("|");

for (int n = 0; n < 61; n++) {

System.out.print("-");

}

System.out.println();

for (int n = 0; n < stackSize; n++) {

if (stackArray[n].equals("-1")) {

System.out.print("| ");

} else {

System.out.print(String.format("| %2s " + " ", stackArray[n]));

}

}

System.out.println("|");

for (int n = 0; n < 61; n++) {

System.out.print("-");

}

System.out.println();

}

public static void main(String[] args) {

TheStack theStack = new TheStack(10);

theStack.push("10");

theStack.push("17");

theStack.push("13");

//See value on top

theStack.peek();

//remove values from Stack

theStack.pop();

theStack.pop();

theStack.pop();

//add many to the stack

theStack.pushMany(" R E D R U M");

//remove all from the stacl

//theStack.popAll();

//remove all from stack and print them

theStack.popDisplayAll();

theStack.displayTheStack();

}

}