How to use arrays to implement Stack in Java

This article will explain in detail how to use arrays to implement the stack in Java. The editor thinks it is very practical, so I share it with you as a reference. I hope you can get something after reading this article.

The requirements of the stack are:

1) the stack has a constructor that accepts a number to initialize its size

2) the stack can hold any type of element

3) the stack has a push () and a pop () method.

A simple stack implementation public class Stack {private E [] arr = null; private int CAP; private int top =-1; private int size = 0; @ SuppressWarnings ("unchecked") public Stack (int cap) {this.CAP = cap; this.arr = (E []) new Object [cap] } public E pop () {if (this.size = = 0) {return null;} this.size--; E result = this.arr [top]; this.arr [top] = null;//prevent memory leaking this.top-- Return result;} public boolean push (E e) {if (isFull ()) return false; this.size++; this.arr [+ + top] = e; return true } public boolean isFull () {if (this.size== this.CAP) return false; return true;} public String toString () {if (this.size==0) {return null;} StringBuilder sb = new StringBuilder () For (int item0; I