点击查看剑指Offer全解【Java & Golang】实现
题目描述
输入一个链表,反转链表后,输出新链表的表头。
思路
第一种是非递归做法,首先记录下pre节点和cur节点,当cur不为null时,先记录下cur的下一个节点,然后cur.next = pre,这样就完成了一次反转,之后再依次让pre、cur后移一位即可,直到cur为null,那么pre节点就是反转后链表的头节点,在返回前需要注意将head.next = null,不然会造成最后一个节点的死循环。
第二种是递归做法,和第一种思路本质上是一样的,首先给递归函数传递pre节点和cur节点,递归终止条件是当cur节点为null时,返回pre节点。递归结构是cur.next = pre,然后再次调用递归函数,把pre节点设置为cur,cur节点设置为later即可。
Java第一种思路实现
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
if (head == null) {
return null;
}
ListNode pre = head;
ListNode cur = head.next;
while (cur != null) {
// 先保存好cur的下一个节点
ListNode later = cur.next;
//反转
cur.next = pre;
pre = cur;
cur = later;
}
head.next = null;
return pre;
}
}
Java第二种思路实现
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode ReverseList(ListNode head) {
if (head == null) {
return null;
}
ListNode pre = helper(head, head.next);
head.next = null;
return pre;
}
private ListNode helper(ListNode pre, ListNode cur) {
if (cur == null) {
return pre;
}
ListNode later = cur.next;
cur.next = pre;
return helper(cur, later);
}
}
Golang第一种思路实现
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
func reverseList(head *ListNode) *ListNode {
if head == nil {
return nil
}
var pre *ListNode = head
var cur *ListNode = head.Next
for cur != nil {
later := cur.Next
// 反转
cur.Next = pre
pre = cur
cur = later
}
head.Next = nil
return pre
}
Golang第二种思路实现
/**
* Definition for singly-linked list.
* type ListNode struct {
* Val int
* Next *ListNode
* }
*/
func reverseList(head *ListNode) *ListNode {
if head == nil {
return nil
}
pre := helper(head, head.Next)
head.Next = nil
return pre
}
func helper(pre, cur *ListNode) *ListNode {
if cur == nil {
return pre
}
later := cur.Next
cur.Next = pre
return helper(cur, later)
}
318



被折叠的 条评论
为什么被折叠?



