Skip to content

Commit f060e76

Browse files
reverse linked list elements
1 parent b1086d7 commit f060e76

File tree

1 file changed

+22
-2
lines changed

1 file changed

+22
-2
lines changed

src/main/java/leetcode/easy/ReverseLinkedList.java

Lines changed: 22 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -25,14 +25,14 @@ public static void main(String[] args) {
2525
System.out.print("Reversed List : ");
2626
reversedHead.printList(); //Output: [5,4,3,2,1]
2727

28-
head = new ListNode(1);
28+
/*head = new ListNode(1);
2929
head.insertAtEnd(2);
3030
head.insertAtEnd(3);
3131
System.out.print("Original List : ");
3232
head.printList();
3333
reversedHead = reverseList(head);
3434
System.out.print("Reversed List : ");
35-
reversedHead.printList();//Output: [2,1]
35+
reversedHead.printList();//Output: [2,1]*/
3636
}
3737

3838
public static ListNode reverseList(ListNode head) {
@@ -54,4 +54,24 @@ public static ListNode reverseList(ListNode head) {
5454
}
5555
return prev;
5656
}
57+
58+
public static ListNode reverseList1(ListNode head) {
59+
if (head == null || head.next == null) {
60+
return head;
61+
}
62+
ListNode prevNode = head;
63+
ListNode currNode = head.next;
64+
65+
while (currNode != null) {
66+
ListNode nextNode = currNode.next;
67+
currNode.next = prevNode;
68+
69+
//update
70+
prevNode = currNode;
71+
currNode = nextNode;
72+
}
73+
head.next = null;
74+
head = prevNode;
75+
return head;
76+
}
5777
}

0 commit comments

Comments
 (0)