时间轴

2025-11-21

init

题目：

P61 旋转链表

https://leetcode.cn/problems/rotate-list/description/?envType=study-plan-v2&envId=top-interview-150

可以把链表分成两组，后面那组的尾部挂到前面那组即可

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
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
struct ListNode {
	int val;
	ListNode *next;
	ListNode()
		: val(0)
		, next(nullptr)
	{
	}
	ListNode(int x)
		: val(x)
		, next(nullptr)
	{
	}
	ListNode(int x, ListNode *next)
		: val(x)
		, next(next)
	{
	}
};

class Solution {
    public:
	ListNode *rotateRight(ListNode *head, int k)
	{
		int nr_node = 0;
		ListNode *p = head, *new_head_prev, *new_head, *tail;

		while (p != nullptr) {
			if (p->next == nullptr) {
				tail = p;
			}
			p = p->next;
			nr_node++;
		}
		if (nr_node == 0) { // in case divided by zero
			return head;
		}
		k = k % nr_node;
		if (k == 0) { // head == nullptr || k==0
			return head;
		}
		new_head_prev = head;
		for (int i = 0; i < nr_node - k - 1; i++) {
			new_head_prev = new_head_prev->next;
		}
		new_head = new_head_prev->next;
		tail->next = head;
		new_head_prev->next = nullptr;
		return new_head;
	}
};