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

// @Title: 反转链表 (Reverse Linked List)
// @Author: 15816537946@163.com
// @Date: 2022-03-26 20:41:22
// @Runtime: 0 ms
// @Memory: 2.7 MB
/**
 * Definition for singly-linked list.
 * type ListNode struct {
 *     Val int
 *     Next *ListNode
 * }
 */


func reverseList(head *ListNode) *ListNode {
    if head == nil || head.Next == nil {
        return head
    }

    p := reverseList(head.Next)
    head.Next.Next = head
    head.Next = nil
    return p
}