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 — java-basics/java-programs/SinglyLinkedListReverse.java at master · learning-zone/java-basics

Expand file tree

/

SinglyLinkedListReverse.java

Copy path
More file actions
More file actions

Latest commit

 

History

History
History
74 lines (65 loc) · 1.55 KB
/

SinglyLinkedListReverse.java

Copy path

File metadata and controls

74 lines (65 loc) · 1.55 KB
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
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
package misc;
public class SinglyLinkedListReverse {
public static void main(String[] args) {
SinglyLinkedList.Node head = new SinglyLinkedList.Node(21);
SinglyLinkedList linkedlist = new SinglyLinkedList(head);
linkedlist.add(new SinglyLinkedList.Node(23));
linkedlist.add(new SinglyLinkedList.Node(37));
linkedlist.add(new SinglyLinkedList.Node(44));
linkedlist.add(new SinglyLinkedList.Node(89));
linkedlist.print();
linkedlist.reverse();
linkedlist.print();
}
}
class SinglyLinkedList {
static class Node {
private int data;
private Node next;
public Node(int data) {
this.data = data;
}
public int data() {
return data;
}
public Node next() {
return next;
}
}
private Node head;
public SinglyLinkedList(Node head) {
this.head = head;
}
/** Java method to add an element to linked list */
public void add(Node node) {
Node current = head;
while (current != null) {
if (current.next == null) {
current.next = node;
break;
}
current = current.next;
}
}
/** Java method to print a singly linked list */
public void print() {
Node node = head;
while (node != null) {
System.out.print(node.data() + " ");
node = node.next();
}
System.out.println(" ");
}
/** Java method to reverse a linked list without recursion */
public void reverse() {
Node pointer = head;
Node previous = null, current = null;
while (pointer != null) {
current = pointer;
pointer = pointer.next;
current.next = previous; // reverse the link
previous = current;
head = current;
}
}
}
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.