Java uses deque to implement the Stack method _java

The example in this article describes how Java uses deque to implement stacks. Share to everyone for your reference. as follows:

Import Java.util.ArrayDeque;
Import Java.util.Deque;
 public class Integerstack {private deque<integer> data = new arraydeque<integer> ();
 public void push (Integer element) {Data.addfirst (element);
 Public Integer POPs () {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);
  int n = stack.peek ();
  System.out.println ("peeked element =" + N);
 System.out.println ("After peeking 1 element:" + stack); }/* Output after pushing 5 elements: [4, 3, 2, 1, 0] popped element = 4 after popping 1 element: [3, 2, 1, 0] peeked Eleme NT = 3 after peeking 1 elemeNT: [3, 2, 1, 0] * *

 

I hope this article will help you with your Java programming.