61.Rotate List

标签：for   tno   new   turn   code   return   head   node   solution   

class Solution {
public:
    ListNode *rotateRight(ListNode *head, int k) {
        if (!head) return NULL;
        int n = 1;
        ListNode *cur = head;
        while (cur->next) {
            ++n;
            cur = cur->next;
        }
        cur->next = head;
        int m = n - k % n;
        for (int i = 0; i < m; ++i) {
            cur = cur->next;
        }
        ListNode *newhead = cur->next;
        cur->next = NULL;
        return newhead;
    }
};

61.Rotate List

标签：for   tno   new   turn   code   return   head   node   solution   

原文地址：https://www.cnblogs.com/smallredness/p/10675421.html