Given a list, rotate the list to the right by k places, where k is non-negative.
For example:
Given 1->2->3->4->5->NULL
and k = 2
,
return 4->5->1->2->3->NULL
.
需要考虑的边界情况:
(1)空链表直接返回NULL;
(2)链表长度等于k时、小于k时,对k的处理。
2019.12.04更新
使用最常规的方法又重做了一遍,需要注意k为链表长度的整数倍时直接返回head,不然下面的逻辑会出错抛空指针异常。
public ListNode rotateRight(ListNode head, int k) {
if(head == null || k==0) {
return head;
}
ListNode node = head;
ListNode second = head;
ListNode pre = new ListNode(0);
pre.next = head;
int length = 0;
//get length
while(node != null) {
length++;
node = node.next;
}
//calculate new head pos
if(k % length == 0) {
return head;
}
int pos = length - k % length;
for(int i = 0; i < pos; ++i) {
pre = second;
second = second.next;
}
ListNode newHead = second;
pre.next = null;
while(second.next != null) {
second = second.next;
}
//link tail to head
second.next = head;
return newHead;
}
思路:首先遍历链表得链表的长度,再通过快慢指针找到新表头,具体做法是先让快指针走k歩,再让两指针同时走直到快指针走到最后一位。此时慢指针的后继指针指向的就是新头指针。
class Solution {
public:
ListNode *rotateRight(ListNode *head, int k) {
if(head==NULL) return head;
int len=0;
ListNode *node=head;
while(node!=NULL){
len++;
node=node->next;
}
k=k%len;
if(k==0) return head;
ListNode *fast=head;
ListNode *slow=head;
for(int i=0;i<k;++i){
fast=fast->next;
}
while(fast->next!=NULL){
fast=fast->next;
slow=slow->next;
}
fast->next=head;
head=slow->next;
slow->next=NULL;
return head;
}
};