GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — MyStackJava/MyStack.java at main · BaseMax/MyStackJava

Expand file tree

/

MyStack.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
126 lines (111 loc) · 2.85 KB
/

MyStack.java

Copy path

File metadata and controls

126 lines (111 loc) · 2.85 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
/*
* @Name: My Stack Implementation In Java
* @Author: Max Base
* @Date: 2022-10-31
* @Class: Data Structure, Dr. Mahsa Soheil Shamaee
*/
// Stack
class MyStack {
private int size;
private int top;
private int[] stack;
// Constructor
public MyStack(int size) {
this.size = size;
this.top = -1;
this.stack = new int[size];
}
// O(1)
// Push an element to the top of the stack and return true
// If the stack is full, throw an error and return false
public boolean push(int value) {
if (top == size - 1) {
System.out.println("Stack is full");
return false;
} else {
top++;
stack[top] = value;
return true;
}
}
// O(1)
// return -1 if stack is empty
// return top value if stack is not empty
// remove top value
public int pop() {
if (top == -1) {
System.out.println("Stack is empty");
return -1;
} else {
int value = stack[top];
top--;
return value;
}
}
// O(1)
// return -1 if stack is empty
// return top value if stack is not empty
// return top value without removing it
public int peek() {
if (top == -1) {
System.out.println("Stack is empty");
return -1;
} else {
return stack[top];
}
}
// O(1)
public boolean isEmpty() {
return top == -1;
}
// O(1)
public boolean isFull() {
return top == size - 1;
}
// O(1)
public int size() {
return top + 1;
}
public boolean resize(int newSize) {
if (newSize < size) {
System.out.println("New size is smaller than current size");
return false;
} else {
int[] newStack = new int[newSize];
for (int i = 0; i < size; i++) {
newStack[i] = stack[i];
}
stack = newStack;
size = newSize;
return true;
}
}
// O(n)
public void printStack() {
if (top == -1) {
System.out.println("Stack is empty");
} else {
System.out.println("Stack items:");
for (int i = top; i >= 0; i--) {
System.out.println(stack[i]);
}
}
}
}
// Example
public class HelloWorld {
public static void main(String []args){
System.out.println("Hello, World!");
MyStack stack = new MyStack(5);
stack.push(1);
stack.push(2);
stack.push(3);
stack.push(4);
stack.push(5);
stack.printStack();
System.out.println("Peek: " + stack.peek());
System.out.println("Pop: " + stack.pop());
System.out.println("Peek: " + stack.peek());
stack.printStack();
}
}
You are visitor 01402503 — GeezerVison does not store the pages you look up.
Best viewed with Netscape Navigator 4.7 or Internet Explorer 6 at 800×600. No cookies required.