Rotate List

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.

Subscribe to see which companies asked this question

主要思路是找到表头的位置，是第Nth的节点从表尾开始的，这样找到节点和链表的尾节点和原始头节点链接，再和开始节点的上一个节点断开连接

-》NULL，就行了

**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode* rotateRight(ListNode* head, int k) {
        if(head==NULL)  
        {  
            return NULL;  
        }  
        if(k<=0)  
        {  
            return head;  
        }  
          
        ListNode*p=head;  
        int count=0;  
        while(p!=NULL)  
        {  
            p=p->next;  
            count++;  
        }  
        k=k%count;  
          
        ListNode*slow=head;  
        ListNode*fast=head;  
          
        for(int i=0;i<k;i++)  
        {  
            if(fast->next==NULL)  
            {  
                break;  
            }  
            fast=fast->next;  
        }  
        while(fast->next!=NULL)  
        {  
            slow=slow->next;  
            fast=fast->next;  
        }  
        fast->next=head;  
        head=slow->next;  
        slow->next=NULL;  
        return head;  
    }
};