leetcode_69 Rotate List

最新推荐文章于 2024-09-18 18:23:55 发布

Maria21

最新推荐文章于 2024-09-18 18:23:55 发布

阅读量157

点赞数

分类专栏：刷题 C/C++ 文章标签： leetcode 链表

本文链接：https://blog.csdn.net/SSJJRRRR/article/details/107663690

版权

C/C++ 同时被 2 个专栏收录

192 篇文章 1 订阅

订阅专栏

刷题

161 篇文章 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

1.首先遍历链表，直到最后一个节点（Tail->next == NULL）

1)求取链表长度len

2)找到尾节点，使尾结点指向头结点，组成循环链表

2 如果 k == len,则直接返回Tail->next, 也就是head

3,.否则 k > 0, 继续遍历（ k %= len, 0 <= i < len - k)，找到新的头结点

/**
 * 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(head == NULL) return head;
        int len = 1;
        ListNode* NewH,*Tail;
        NewH = Tail = head;
        while(Tail->next)
        {
            Tail = Tail->next;
            len++;
        }
        Tail->next = head;
        if(k %= len)
        {
            for(auto i = 0; i < len - k; i++)
            {
                Tail = Tail->next;
            }
        }
        NewH = Tail->next;
        Tail->next = NULL;
        return NewH;
    }
};