rotate-list

最新推荐文章于 2022-03-21 23:24:02 发布

llwjason5555

最新推荐文章于 2022-03-21 23:24:02 发布

阅读量143

点赞数

分类专栏： leetcode

本文链接：https://blog.csdn.net/llwjason5555/article/details/77991960

版权

leetcode 专栏收录该内容

116 篇文章 0 订阅

订阅专栏

题目：

Given a list, rotate the list to the right by k places, where k is non-negative.
For example:
Given1->2->3->4->5->NULLand k =2,
return4->5->1->2->3->NULL.

程序：

class Solution {
public:
   ListNode *rotateRight(ListNode *head, int k)
   {
    if(head==nullptr || k<=0)
       return head;
    ListNode *p=head;
    int len = 0;
    while(p)
    {
        ++len;
        p = p->next;
    }
    k = k%len;//k可能大于len
    if(k==0) return head;
    ListNode *fast = head,*slow = head;
    for(int i=0;i<k;i++)
        fast = fast->next;
    while(fast->next)
    {
        slow = slow->next;
        fast = fast->next;
    }
    ListNode *newHead = slow->next;
    slow->next = nullptr;
    fast->next = head;
    return newHead;
   }
};