LeetCode 61. Rotate List

1. 题目要求

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.

2. 解题思路

题目要求是从右向左k个数据， 这里可以转为从左向右 k = (count - (k + 1) % count) % count; 个数据进行处理

3. code

class Solution {
public:
    ListNode* rotateRight(ListNode* head, int k) {
        if (!head) return nullptr;
        ListNode myhead(0);
        ListNode * pre = &myhead;
        pre->next = head;
        ListNode * myend = pre;

        int count = 0;
        while (head){
            count++;
            head = head->next;
            myend = myend->next;
        }

        //k = (count - k - 1) % count; 
        k = (count - (k + 1) % count) % count;

        head = pre->next;
        count = 0;
        while (count < k){
            head = head->next;
            count++;
        }

        myend->next = myhead.next;
        myhead.next = head->next;
        head->next = nullptr;

        return myhead.next;
    }
};

4. 大神解法

/*
There is no trick for this problem. Some people used slow/fast pointers to find the tail node but I don't see the benefit (in the sense that it doesn't reduce the pointer move op) to do so. So I just used one loop to find the length first.
*/
class Solution {
public:
    ListNode* rotateRight(ListNode* head, int k) {
        if(!head) return head;

        int len=1; // number of nodes
        ListNode *newH, *tail;
        newH=tail=head;

        while(tail->next)  // get the number of nodes in the list
        {
            tail = tail->next;
            len++;
        }
        tail->next = head; // circle the link

        if(k %= len) 
        {
            for(auto i=0; i<len-k; i++) tail = tail->next; // the tail node is the (len-k)-th node (1st node is head)
        }
        newH = tail->next; 
        tail->next = NULL;
        return newH;
    }
};