题目描述:
Given a linked list, rotate the list to the right by k places, where k is non-negative.
Example 1:
Input: 1->2->3->4->5->NULL, k = 2 Output: 4->5->1->2->3->NULL Explanation: rotate 1 steps to the right: 5->1->2->3->4->NULL rotate 2 steps to the right: 4->5->1->2->3->NULL
Example 2:
Input: 0->1->2->NULL, k = 4 Output:2->0->1->NULL
Explanation: rotate 1 steps to the right: 2->0->1->NULL rotate 2 steps to the right: 1->2->0->NULL rotate 3 steps to the right:0->1->2->NULL
rotate 4 steps to the right:2->0->1->NULL
中文理解:
给定一个链表,将聊表的值循环右移k位,输出最终的结果链表结果。
解题思路:
使用快慢指针,分为三种情况,如果k等于链表长度,则返回head,如果k大于链表长度,则k=k%len,如果k小于链表长度,先让快指针走k步,然后快慢指针一起走,当快指针为最后一个节点时,停止,此时slow.next为新头,同时将head拼接到fast.next,slow.next=null,返回即可。
代码(java):
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode rotateRight(ListNode head, int k) {
if(head==null || head.next==null)return head;
int count=0,index=k;
ListNode fast=head,slow=head;
while(index>0 && fast!=null){
fast=fast.next;
index--;
count++;
}
//k等于链表长度
if(index==0 && fast==null)return head;
else if(index>0){
//k大于链表长度
fast=head;
k=k%count;
while(k>0){
fast=fast.next;
k--;
}
}
while(fast.next!=null){
fast=fast.next;
slow=slow.next;
}
fast.next=head;
ListNode res=slow.next;
slow.next=null;
return res;
}
}