61. 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

思路：

求出list的长度后，安照旋转的规则做就可以了。

代码：

/**
 * 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||k==0) return head;
            ListNode* head1=head;
            ListNode* head2=head;
            ListNode* start=NULL;
            ListNode* end=NULL;
            int count=0;
            while(head1)
            {
                ++count;
                head1=head1->next;
            }
            k=k%count;
            if(k==0) return head;
            for(int i=0;i<(count-k);++i)
            {end=head2;head2=head2->next;}
            // end=head1;
            start=head2;
            head2=end;
            for(int i=(count-k);i<count;++i)
            {head2=head2->next;}
            head2->next=head;
            end->next=NULL;
            return start;
    }
};