LeetCode Algorithm 0061 - Rotate List (Medium)

最新推荐文章于 2019-11-02 18:03:51 发布

沙沙的兔子

最新推荐文章于 2019-11-02 18:03:51 发布

阅读量176

点赞数

分类专栏： LeetCode 文章标签： LeetCode linkedlist twopointers 算法基础

本文链接：https://blog.csdn.net/darkrabbit/article/details/90110437

版权

LeetCode 专栏收录该内容

28 篇文章 0 订阅

订阅专栏

LeetCode Algorithm 0061 - Rotate List (Medium)

返回分类：全部文章 >> 基础知识

返回上级：LeetCode 算法目录

Problem Link: https://leetcode.com/problems/rotate-list/

Related Topics: Linked List Two Pointers

Description

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

Solution C++

// Author: https://blog.csdn.net/DarkRabbit
// Problem: https://leetcode.com/problems/rotate-list/
// Difficulty: Medium
// Related Topics: `Linked List` `Two Pointers`

#pragma once

#include "pch.h"

namespace P61RotateList
{
    // 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 || head->next == NULL)
            {
                return head;
            }

            ListNode* last;
            ListNode* node = head;
            int count = 0;
            while (node != 0)
            {
                count++;
                last = node;
                node = node->next;
            }

            k %= count;
            if (k == 0)
            {
                return head;
            }

            node = head;
            k = count - k - 1;
            for (int i = 0; i < k; i++)
            {
                node = node->next;
            }
            last->next = head;
            head = node->next;
            node->next = NULL;

            return head;
        }
    };
}