-
Notifications
You must be signed in to change notification settings - Fork 3
/
61.旋转链表.js
53 lines (48 loc) · 1.15 KB
/
61.旋转链表.js
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
52
53
/**
* 给定一个链表,旋转链表,将链表每个节点向右移动 k 个位置,其中 k 是非负数。
示例 1:
输入: 1->2->3->4->5->NULL, k = 2
输出: 4->5->1->2->3->NULL
解释:
向右旋转 1 步: 5->1->2->3->4->NULL
向右旋转 2 步: 4->5->1->2->3->NULL
示例 2:
输入: 0->1->2->NULL, k = 4
输出: 2->0->1->NULL
解释:
向右旋转 1 步: 2->0->1->NULL
向右旋转 2 步: 1->2->0->NULL
向右旋转 3 步: 0->1->2->NULL
向右旋转 4 步: 2->0->1->NULL
*/
/**
* Definition for singly-linked list.
* function ListNode(val) {
* this.val = val;
* this.next = null;
* }
*/
/**
* @param {ListNode} head
* @param {number} k
* @return {ListNode}
*/
var rotateRight = function(head, k) {
if(!head) return null
if(head.next === null) return head
let old_head = head
let n
/* 单向链表形成环形链表 */
for(n=1;old_head.next;n++){
old_head = old_head.next
}
old_head.next = head
let new_head = head
for(let i=0;i <= n - k % n -1 ; i++){
new_head = new_head.next
}
const tail = new_head.next
new_head.next = null
return tail
};
console.log( rotateRight )