# 24.反转链表

## 题目

定义一个函数，输入一个链表的头节点，反转该链表并输出反转后链表的头节点。

示例:

```cpp
 输入: 1->2->3->4->5->NULL
 输出: 5->4->3->2->1->NULL
```

限制：

```cpp
 0 <= 节点个数 <= 5000
```

注意：本题与主站 206 题相同：<https://leetcode-cn.com/problems/reverse-linked-list/>

* 来源：力扣（LeetCode）
* 链接：<https://leetcode-cn.com/problems/fan-zhuan-lian-biao-lcof>
* 著作权归领扣网络所有。商业转载请联系官方授权，非商业转载请注明出处。

## 解法

> [GitHub](https://github.com/RyukieSama/RyukiePlayground/blob/main/剑指Offer.playground/Pages/24.反转链表.xcplaygroundpage/Contents.swift)

```swift
func reverseList(_ head: ListNode?) -> ListNode? {
    var node: ListNode?
    var temp: ListNode? = head

    while let current = temp {
        let n = ListNode(current.val)
        n.next = node
        node = n
        temp = current.next
    }

    return node
}
```


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://ryukiedev.gitbook.io/wiki/shu-ju-jie-gou-yu-suan-fa/jian-zhi-offerswift/24.-fan-zhuan-lian-biao.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.