厚积薄发打卡Day106:链表(四)<反转链表>
反转链表
反转一个单链表。
输入: 1->2->3->4->5->NULL 输出: 5->4->3->2->1->NULL
实现
-
非递归:
public class ReverseNodeList { public static ListNode reverseNodeList(ListNode head) { ListNode prev = null; ListNode cur = head; while (cur != null) { ListNode next = cur.next; cur.next = prev; prev = cur; cur = next; } return prev; } }
在上述代码中,变量 cur 指向当前遍历到的节点,变量
prev
指向当前节点的前一个节点,而变量 next指向下一个节点。每遍历一个节点之后,都让变量prev
指向该节点。在遍历到尾节点之后,变量
prev
最后一次被更新,因此,变量prev
最终指向原始链表的尾节点,也就是反转链表的头节点。验证:
public static void main(String[] args) { ListNode node1 = new ListNode(1); ListNode node2 = new ListNode(2); ListNode node3 = new ListNode(3); ListNode node4 = new ListNode(4); ListNode node5 = new ListNode(5); ListNode node6 = new ListNode(6); node1.next = node2; node2.next = node3; node3.next = node4; node4.next = node5; node5.next = node6; System.out.print("original==>"); ListNode.printNodeList(node1); System.out.print("reverse==>"); ListNode.printNodeList(reverseNodeList(node1)); }
original==>1->2->3->4->5->6->NULL reverse==>6->5->4->3->2->1->NULL
-
递归:
public class ReverseWithRecur { public static ListNode reverseWithRecur(ListNode head){ //1->2->3->4->5->6 if (head == null || head.next ==null){ return head; } ListNode cur = reverseWithRecur(head.next); //将【原节点的下一节点】指向【原节点的上一节点】 //1->2->3->4->5<=>6 head.next.next = head; //断掉【原节点的下一节点】指向 //1->2->3->4->5<-6 head.next = null; return cur; } public static void main(String[] args) { ListNode node1 = new ListNode(1); ListNode node2 = new ListNode(2); ListNode node3 = new ListNode(3); ListNode node4 = new ListNode(4); ListNode node5 = new ListNode(5); ListNode node6 = new ListNode(6); node1.next = node2; node2.next = node3; node3.next = node4; node4.next = node5; node5.next = node6; System.out.print("original==>"); ListNode.printNodeList(node1); System.out.print("reverse==>"); ListNode.printNodeList(reverseWithRecur(node1)); } }
original==>1->2->3->4->5->6->NULL reverse==>6->5->4->3->2->1->NULL