61.旋转链表

最新推荐文章于 2024-10-16 19:08:56 发布

千树、

最新推荐文章于 2024-10-16 19:08:56 发布

阅读量96

点赞数

分类专栏： leetcode 文章标签：算法 leetcode 链表

本文链接：https://blog.csdn.net/weixin_42962559/article/details/115261196

版权

leetcode 专栏收录该内容

9 篇文章 0 订阅

订阅专栏

题目描述

Given the head of a linked list, rotate the list to the right by k places.

解答

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode() : val(0), next(nullptr) {}
 *     ListNode(int x) : val(x), next(nullptr) {}
 *     ListNode(int x, ListNode *next) : val(x), next(next) {}
 * };
 */
class Solution {
public:
    ListNode* rotateRight(ListNode* head, int k) {
        if(k=0 || head == nullptr || head->next == nullptr) return head;
        ListNode * temp = head;
        ListNode * pre = temp;
        uint32_t flag = 1;
        while(temp->next != nullptr)
        {
           flag++;
           temp = temp->next;
        }
        k = k % flag;
        temp = head;
        for(int i = 0; i < k; ++i)
        {
            while(temp->next != nullptr)
            {
                pre = temp;
                temp = temp->next;
            }
            pre->next = nullptr;
            temp->next = head;
            head = temp;
        }
        return head;
    }
};