Leetcode题集——rotate-list

Given a list, rotate the list to the right by k places, where k is non-negative.

For example:
Given1->2->3->4->5->NULLand k =2,

return4->5->1->2->3->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;
      ListNode *p=head;
        int n=0;
      while(p->next)
      {
        n++;
        p=p->next;
      }
      n++;//计算链表的结点个数
        
      k=k%n;
      p->next=head;//此时处理尾指针
        
      ListNode *q=head;
      for(int i=0;i<n-k-1;i++)
         q=q->next;//找到倒数第k+1个结点
      head=q->next;//头指针为倒数第k个结点
      q->next=NULL;
        return head;
    }
};