61.Rotate List

转载于 2019-04-09 10:35:00 发布 · 53 阅读

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/smallredness/p/10675421.html

本文详细解析了链表右旋转算法的实现过程，通过计算链表长度并进行节点连接，最终返回新的头节点，实现链表的高效旋转。

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;
    }
};

转载于:https://www.cnblogs.com/smallredness/p/10675421.html