The example of this article tells the method of Java using Deque to implement the stack. Share it for everyone for your reference. The specifics are as follows:
Import java.util.arrayDeque; Import Java.util.deque; Public Class IntegerStack {Private Dequ <Integer> Data = New Array_ IC Void Push (INTEGER ELEMENT) {data.addfirst (Element);} Public Integer pop () {Return data.removefirst ();} Public Integer Peek () {Return Data.peekfirst ();} Public String TostRing () {Return Data.tostring (); } Public Static Void Main (String [] ARGS ) {IntegerStack Stack = New IntegerStack (); for (int i = 0; I <5; I ++) {stack.push (i);} System.out.println ("After Pushing 5 Elements:"+Stack) ; int m = stack.pop (); System.out.println ("Popped Element =" + M); System.out.println ("After Popping 1 Element:" + Stack); m .out.println ("Peeked Element =" + N); System.out.println ("After Peeking 1 Element:" + Stack); 0] Popped Element = 4AFTER POPPING 1 ELEMENT: [3, 2, 1, 0] Peeked Element = 3AFTER Peeking 1 Element: [3, 2, 1, 0]*/ 0]It is hoped that this article is helpful to everyone's Java program design.