LeetCode刷题笔记--61. Rotate List

最新推荐文章于 2023-06-22 14:58:06 发布

vivian0239

最新推荐文章于 2023-06-22 14:58:06 发布

阅读量118

点赞数

本文链接：https://blog.csdn.net/vivian0239/article/details/89678699

版权

61. Rotate List

Medium

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.把头记录下来

2.数list的长度，在数完后把末位->next接到头上，像不像贪食蛇？

3.计算一下从哪里切开？

4.切开，末位->next=NULL

5.返回头

下面是AC代码：

/**
* Definition for singly-linked list.
* struct ListNode {
*     int val;
*     ListNode *next;
*     ListNode(int x) : val(x), next(NULL) {}
* };
*/
class Solution {
public:
    int count(ListNode* head,int n,ListNode* c)
    {
        if(head->next==NULL)
        {
            head->next=c;
            return n;
        }
        else return count(head->next,n+1,c);
    }

    ListNode* findHead(ListNode* head,int k)
    {
        while(k>0)
        {
            head=head->next;
            k--;
        }

            ListNode* c=head->next;
            head->next=NULL;
            return c;

    }

    ListNode* rotateRight(ListNode* head, int k) {
        if(head==NULL)return head;
        ListNode* c=head;//记录下头
        int n=1;
        int num=count(head,n,c);//num是list的长度，从1开始计数
        k=num-k%num-1;//从这里切开
        return findHead(head,k);

    }
};