[Leetcode 61, Medium] Rotate List

最新推荐文章于 2024-09-21 10:02:17 发布

simplify2012

最新推荐文章于 2024-09-21 10:02:17 发布

阅读量364

点赞数

分类专栏： Leetcode_medium 文章标签： leetcode C++

本文链接：https://blog.csdn.net/u012212811/article/details/46976743

版权

Leetcode_medium 专栏收录该内容

99 篇文章 0 订阅

订阅专栏

Problem:

Given a list, rotate the list to the right by k places, where k is non-negative.

For example:
Given 1->2->3->4->5->NULL and k = 2,
return 4->5->1->2->3->NULL.

Analysis:

Solutions:

C++:

    ListNode* rotateRight(ListNode* head, int k) {
        if(head == NULL || head->next == NULL)
            return head;
        
        ListNode *p_back = head;
        int size = 0;
        for(; p_back != NULL; p_back = p_back->next)
            ++size;
        k %= size;
        if(k == 0)
            return head;

        p_back = head;
        ListNode *p_front = head;
        for(int i = 0; i < k; p_front = p_front->next, ++i) {
            if(p_front == NULL)
                return NULL;
        }
        
        if(p_front == NULL)
            return NULL;
        
        for(; p_front->next != NULL; p_front = p_front->next, p_back = p_back->next) {}
        
        ListNode *p_new_head = p_back->next;
        p_back->next = NULL;
        p_front->next = head;
        return p_new_head;
    }

Java :

Python: