Reverse Linked List II

最新推荐文章于 2024-01-12 14:53:46 发布

Nanitou

最新推荐文章于 2024-01-12 14:53:46 发布

阅读量378

点赞数

分类专栏： LEETCODE-Linked List

本文链接：https://blog.csdn.net/Nanitou/article/details/43646729

版权

LEETCODE-Linked List 专栏收录该内容

6 篇文章 0 订阅

订阅专栏

Reverse a linked list from position m to n. Do it in-place and in one-pass.

For example:
Given 1->2->3->4->5->NULL, m = 2 and n = 4,

return 1->4->3->2->5->NULL.

Note:
Given m, n satisfy the following condition:
1 ≤ m ≤ n ≤ length of list.

class Solution {
public:
    ListNode* reverse ( ListNode* head, int k ) {
        if ( head == NULL || k <= 0 ) { return NULL; }

        ListNode* p = head, *q = head->next, *r = NULL;
        int count = k;
        while ( q && 1 < count--  ) {
            r = q->next;
            q->next = p;
            p = q;
            q = r;
        }

        /* 接上后面的结点们 */
        head->next = q;

        return p;
    }
    ListNode *reverseBetween ( ListNode *head, int m, int n )    {
        if ( head == NULL ) { return NULL; }

        /* 为了避免讨论 m == 1 的情况，设置一个头结点 */
        ListNode* nhead = new ListNode ( -1 );
        nhead->next = head;
        int i = m;
        while ( i-- ) { nhead = nhead->next; }

        nhead->next = reverse ( nhead->next, n - m + 1 );

        return head->next;
    }
};