leetcode【61】Rotate List

问题描述：

源码：

方法一：

这题就是剑指offer第22题目剑指offer-链表中倒数第k个结点

第一次尝试，超时，因为循环找了前指针。

/**
 * 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 head;
        ListNode *pre = head, *back = head;
        while(k--){
            pre = pre->next;
            if(pre == NULL)     pre = head;
        }
        while(pre->next != NULL){
            back = back->next;
            pre = pre->next;
        }
        pre->next = head;
        pre = back->next;
        back->next = NULL;
        return pre;
    }
};

修改方案很简单，先求出总长度在取余就可。

/**
 * 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 head;
        ListNode *pre = head, *back = head;
        int n = 0;
        while(pre){
            pre = pre->next;
            n++;
        }
        k = k % n;
        pre = head;
        
        while(k--){
            pre = pre->next;
            if(pre == NULL)     pre = head;
        }
        while(pre->next != NULL){
            back = back->next;
            pre = pre->next;
        }
        pre->next = head;
        pre = back->next;
        back->next = NULL;
        return pre;
    }
};

方法2：

只用了一个指针，其实差不多 ，表示结果的时候还是用到了第二个指针。

/**
 * 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 head;
        ListNode *pre = head;
        int n = 1;
        while(pre->next){
            pre = pre->next;
            n++;
        }
        int m = n - k % n;
        
        pre->next = head;
        for(int i=0; i<m; i++)
            pre = pre->next;
        ListNode *result = pre->next;
        pre->next = NULL;
        return result;
    }
};