-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathreverseList.java
92 lines (74 loc) · 1.82 KB
/
reverseList.java
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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
public class reverseList
{
class Node
{
int data;
Node next;
public Node(int data)
{
this.data = data;
this.next = null;
}
}
public Node head = null;
public Node tail = null;
public void addNode(int data)
{
Node newNode = new Node(data);
if(head == null)
{
head = newNode;
tail = newNode;
}
else
{
tail.next = newNode;
tail = newNode;
}
}
public void reverse(Node current)
{
if(head == null)
{
System.out.println("List is empty");
return;
}
else
{
if(current.next == null)
{
System.out.print(current.data + " ");
return;
}
reverse(current.next);
System.out.print(current.data + " ");
}
}
public void display()
{
Node current = head;
if(head == null)
{
System.out.println("List is empty");
return;
}
while(current != null)
{
System.out.print(current.data + " ");
current = current.next;
}
System.out.println();
}
public static void main(String[] args)
{
reverseList sList = new reverseList();
sList.addNode(1);
sList.addNode(2);
sList.addNode(3);
sList.addNode(4);
System.out.println("Original List: ");
sList.display();
System.out.println("Reversed List: ");
sList.reverse(sList.head);
}
}