LeetCode-Rotate List

最新推荐文章于 2024-10-01 23:05:47 发布

tymy

最新推荐文章于 2024-10-01 23:05:47 发布

阅读量339

点赞数

分类专栏： leetCode 文章标签： LeetCode IT面试算法 OJ

本文链接：https://blog.csdn.net/u010266551/article/details/9798055

版权

leetCode 专栏收录该内容

123 篇文章 0 订阅

订阅专栏

/**
 * 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) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        ListNode *p = head;
        ListNode *q = head;
        ListNode *newHead = head;
        int len = getLength(head);
        k = len > 0 ? k % len : k;
        if (head == NULL || head->next == NULL || k == 0)
        {
            return newHead;
        }
        while (k--)
        {
            p = p->next;
        }
        while (p->next != NULL)
        {
            p = p->next;
            q = q->next;
        }
        newHead = q->next;
        p->next = head;
        q->next = NULL;
        return newHead;
    }
    int getLength(ListNode *head)
    {
        int len = 0;
        while (head != NULL)
        {
            head = head->next;
            ++len;
        }
        return len;
    }
};