forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathSoution.ts
38 lines (36 loc) · 874 Bytes
/
Soution.ts
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
/**
* Definition for singly-linked list.
* class ListNode {
* val: number
* next: ListNode | null
* constructor(val?: number, next?: ListNode | null) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
* }
*/
function rotateRight(head: ListNode | null, k: number): ListNode | null {
if (k == 0 || head == null || head.next == null) return head;
// mod n
let n = 0;
let p = head;
while (p != null) {
++n;
p = p.next;
}
k %= n;
if (k == 0) return head;
let fast = head,
slow = head;
for (let i = 0; i < k; ++i) {
fast = fast.next;
}
while (fast.next != null) {
slow = slow.next;
fast = fast.next;
}
let start = slow.next;
slow.next = null;
fast.next = head;
return start;
}