Algorithm on kj’s bloghttps://kfjie.me/en/tags/algorithm/Recent content from kj’s blogHugoenNone (Kfjie)None (Kfjie)All articles on this blog are licensed under the BY-NC-SA license agreement unless otherwise stated. Please indicate the source when reprinting!Sun, 18 Oct 2026 20:00:00 +0800Notes: Reversing a Linked Listhttps://kfjie.me/en/post/reverse-linked-list/Sun, 18 Oct 2026 20:00:00 +0800None (Kfjie)https://kfjie.me/en/post/reverse-linked-list/ Notes: Reversing a Linked List

Author: Kfjie(None)

r: Reverse the entire singly linked list

First, let’s look at this set of linked lists

For example, suppose we have the following linked list:

head
 ↓
 1 → 2 → 3 → 4 → null

While keeping the positions of the nodes in the diagram unchanged, we need to reverse the directions of the edges between the nodes:

null ← 1 ← 2 ← 3 ← 4
                   ↑
                  head

It turns out that 1 It is a leaf node; there is no previous node. After reversal,1 It then becomes a leaf node, and its next Should point to null, and the new root node is 4。

Published on 2026-10-18 at kj’s blog, last modified on 2026-10-18

]]>Notes