FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
Java/src/main/java/com/datastructures/Stack.java at Development · ailvcheng/Java · GitHub
ailvcheng
/
Java
Public
forked from
TheAlgorithms/Java
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
Java
/
src
/
main
/
java
/
com
/
datastructures
/
Stack.java
Copy path
More file actions
More file actions
Latest commit
History
History
History
123 lines (101 loc) · 2.56 KB
Breadcrumbs
Java
/
src
/
main
/
java
/
com
/
datastructures
/
Stack.java
Copy path
File metadata and controls
123 lines (101 loc) · 2.56 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
package
com
.
datastructures
;
import
java
.
io
.
Serializable
;
import
java
.
util
.
EmptyStackException
;
public
class
Stack
<
E
>
implements
Serializable
{
/**
* Initial capacity allocated to stack on object creation
*/
private
final
int
INITIAL_CAPACITY
=
10
;
/**
* Increment in memory space once stack is out of space
*/
private
final
int
EXTENDED_CAPACITY
=
10
;
/**
* Position of tail in stack
*/
private
int
tail
= -
1
;
/**
* Size of stack at any given time
*/
private
int
size
;
/**
* Uninitialized array to hold stack elements.
* Will be initialized with initial capacity once the object is created
*/
private
E
[]
elements
;
/**
* No argument to create stack object with initial capacity
*/
@
SuppressWarnings
(
"unchecked"
)
public
Stack
() {
elements
= (
E
[])
new
Object
[
INITIAL_CAPACITY
];
}
/**
* Method to check if the given stack is empty or not
*/
public
boolean
empty
() {
return
elements
==
null
||
size
==
0
;
}
/**
* Method to check the element on head without removing it
*/
public
E
peek
() {
if
(
empty
()) {
throw
new
EmptyStackException
();
}
return
elements
[
tail
];
}
/**
* Method to remove the top element from stack
*/
public
E
pop
() {
if
(
empty
()) {
throw
new
EmptyStackException
();
}
E
removedElement
=
elements
[
tail
];
tail
--;
size
--;
return
removedElement
;
}
/**
* Method to add element to stack
*/
@
SuppressWarnings
(
"unchecked"
)
public
void
push
(
E
e
) {
tail
=
tail
+
1
;
if
(
tail
>=
INITIAL_CAPACITY
) {
E
[]
extendedElements
= (
E
[])
new
Object
[
INITIAL_CAPACITY
+
EXTENDED_CAPACITY
];
System
.
arraycopy
(
elements
,
0
,
extendedElements
,
0
,
tail
);
elements
=
extendedElements
;
}
elements
[
tail
] =
e
;
size
=
size
+
1
;
}
/**
* Method to search for an element in stack
*/
public
int
search
(
E
o
) {
int
index
= -
1
;
boolean
found
=
false
;
if
(
empty
()) {
return
-
1
;
}
for
(
int
i
=
0
;
i
<
size
();
i
++) {
if
(
elements
[
i
].
equals
(
o
)) {
index
=
i
;
found
=
true
;
break
;
}
}
if
(
found
) {
index
=
tail
-
index
+
1
;
}
return
index
;
}
/**
* Method to get size of stack
*/
public
int
size
() {
return
size
;
}
}
Back
|
FazBrowse Home
|
New Git URL