LeetCode 92. Reverse Linked List II 时间复杂度（O(n)）

最新推荐文章于 2022-11-08 17:43:05 发布

ziyue246

最新推荐文章于 2022-11-08 17:43:05 发布

阅读量155

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/ziyue246/article/details/81380825

版权

LeetCode 专栏收录该内容

112 篇文章 0 订阅

订阅专栏

时间复杂度（O(n)）

class Solution {
public:
    ListNode* reverseBetween(ListNode* head, int m, int n) {
       if(head==NULL||m==n) return head;
        ListNode *node = head;
        int count =0 ;
        if(m>n){
            int tmp = n;
            n = m;
            m = tmp;
        }
        ListNode *pm = head;
        ListNode *pn = head;

        if(m==1){
            pm = head;
            ListNode *qm = head;
            for(int i=m;i<n&&pm->next!=NULL;++i){
                qm = pm->next;
                pm->next = pm->next->next;
                qm->next = head;
                head = qm;
            }
        }
        while(node!=NULL){
            ++count;
            if(m==count+1){
                pm = node;    
                ListNode *qm = pm;
                pm = pm->next;
                for(int i=m;i<n&&pm->next!=NULL;++i){
                    ListNode *tmp_m = pm->next;
                    pm->next = pm->next->next;
                    tmp_m->next = qm->next;
                    qm->next = tmp_m;
                }break;
            }
            node = node->next;
        }
        return head;
    }
};