GV

GeezerVison

The World Wide Web, restored to 800 pixels of glory.

Home|About|Gaming cabinet|Archives|How it works|Starter sites

On this site

  • Sign in
  • ActionsCI/CD and automation
  • CodespacesCloud development environments
  • All Features
  • Documentation
  • Training
  • Certifications
  • Build with Copilot
  • Customize Copilot
  • Integrations
  • Trending repos
  • GitHub Sponsors
  • Developer articles
  • Enterprises

This view

  • Original page
  • New address

GeezerVison is showing github.com — Data-Structure-Algorithm-Java/Stack/ReverseStack.java at main · gourabofficial/Data-Structure-Algorithm-Java

Expand file tree

/

ReverseStack.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
42 lines (31 loc) · 863 Bytes
/

ReverseStack.java

Copy path

File metadata and controls

42 lines (31 loc) · 863 Bytes
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
import java.util.Stack;
public class ReverseStack {
public static void main(String[] args) {
Stack<Integer> list = new Stack<>();
list.push(10);
list.push(20);
list.push(30);
list.push(40);
System.out.println("Before Reverse : " +list);
reverse(list);
System.out.println("After Reverse: " +list);
}
static void PushAtButtom(Stack<Integer> list, int element) {
// base case
if (list.isEmpty()) {
list.push(element);
return;
}
int top = list.pop();
PushAtButtom(list, element);
list.push(top);
}
static void reverse(Stack<Integer> list){
if(list.isEmpty()){
return;
}
int top = list.pop();
reverse(list);
PushAtButtom(list, top);
}
}
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.