LeetCode | 61. Rotate List

最新推荐文章于 2020-11-06 16:48:22 发布

1LOVESJohnny

最新推荐文章于 2020-11-06 16:48:22 发布

阅读量118

点赞数

分类专栏： LeetCode 文章标签： LeetCode 链表 List

本文链接：https://blog.csdn.net/iLOVEJohnny/article/details/101796948

版权

LeetCode 专栏收录该内容

285 篇文章 0 订阅

订阅专栏

题目：

Given a linked list, rotate the list to the right by k places, where k is non-negative.

Example 1:

Input: 1->2->3->4->5->NULL, k = 2
Output: 4->5->1->2->3->NULL
Explanation:
rotate 1 steps to the right: 5->1->2->3->4->NULL
rotate 2 steps to the right: 4->5->1->2->3->NULL

Example 2:

Input: 0->1->2->NULL, k = 4
Output: 2->0->1->NULL
Explanation:
rotate 1 steps to the right: 2->0->1->NULL
rotate 2 steps to the right: 1->2->0->NULL
rotate 3 steps to the right: 0->1->2->NULL
rotate 4 steps to the right: 2->0->1->NULL

代码：

/**
 * 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 || k == 0)
            return head;
        ListNode* p = head, *q = head, *prep = head, *preq = head;
        int l = 0;
        while(p != NULL)
        {
            p = p->next;
            l++;
        }
        k = k % l;
        if(!k)
            return head;
        p = head;
        while(k --)
        {
            p = p->next;
        }
        while(p != NULL)
        {
            preq = q;
            q = q->next;
            prep = p;
            p = p->next;
        }
        prep->next = head;
        preq->next = NULL;
        head = q;
        return head;
    }
};