92. Reverse Linked List II

最新推荐文章于 2021-07-02 10:39:06 发布

guyy_moon

最新推荐文章于 2021-07-02 10:39:06 发布

阅读量270

点赞数

分类专栏： Leetcode

本文链接：https://blog.csdn.net/faan0966/article/details/80457406

版权

Leetcode 专栏收录该内容

184 篇文章 0 订阅

订阅专栏

92. Reverse Linked List II

class Solution {
public:
    ListNode* reverseBetween(ListNode* head, int m, int n) {
        if(head == NULL || m == n){
            return head;
        }
        ListNode *dummy = new ListNode(0);
        ListNode *cur = head;
        ListNode *temp = head->next;
        
        for(int i=1;i<m;i++){
            dummy = cur;
            cur = temp;
            temp = temp->next;
        }
        ListNode *dummy2 = dummy;
        ListNode *dummym = cur;
        for(int i=m; i<n;i++){
            cur->next = dummy;
            dummy = cur;
            cur = temp;
            temp = temp->next;
        }
        cur->next = dummy;
        dummy2->next = cur;
        dummym->next = temp;
        
        if(m == 1)
            return dummy2->next;
        else
            return head;
    }
};