GeezerVisonThe World Wide Web, restored to 800 pixels of glory. |
| Home|About|Gaming cabinet|Archives|How it works|Starter sites |
GeezerVison is showing github.com — Data-Structure-Algorithm-Java/Stack/ExampleOne.java at main · gourabofficial/Data-Structure-Algorithm-Java Expand file tree/ Copy pathExampleOne.javaMore file actions 33 lines (24 loc) · 721 Bytes / Copy pathExampleOne.javaFile metadata and controls33 lines (24 loc) · 721 Bytes 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 import java.util.Stack; public class ExampleOne { public static void main(String[] args) { Stack<Integer> list = new Stack<>(); //push operation list.push(10); list.push(20); list.push(30); list.push(40); list.push(50); System.out.println(list); System.out.println(list.peek()); //pop operation list.pop(); list.pop(); System.out.println("After Pop operations " + list); boolean isEmpty = list.isEmpty(); if(isEmpty){ System.out.println("Yes stack is Empty "); }else{ System.out.println("No , Stack is not Empty "); } } } |
| 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. |