/**
* Definition for singly-linked list.
* function ListNode(val, next) {
* this.val = (val===undefined ? 0 : val)
* this.next = (next===undefined ? null : next)
* }
*/
/**
* @param {ListNode} head
* @param {number} k
* @return {ListNode}
*/
var rotateRight = function(head, k) {
if(!head||k===0) return head;
let p=head;
let len=1;
while(p.next){
len++;
p=p.next;
}
p.next=head;
k=len-k%len;
while(k--) p=p.next;
head=p.next;
p.next=null;
return head;
};
【leetcode】旋转链表
最新推荐文章于 2024-07-22 16:27:42 发布