LeetCode 92: Reverse Linked List II

最新推荐文章于 2024-05-18 16:06:33 发布

claviclelau

最新推荐文章于 2024-05-18 16:06:33 发布

阅读量339

点赞数

分类专栏： LeetCode

本文链接：https://blog.csdn.net/claviclelau/article/details/11105265

版权

LeetCode 专栏收录该内容

56 篇文章 0 订阅

订阅专栏

Difficulty: 3

Frequency: 2

Problem:

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.

Solution:

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     ListNode *next;
 *     ListNode(int x) : val(x), next(NULL) {}
 * };
 */
class Solution {
public:
    ListNode *reverseBetween(ListNode *head, int m, int n) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        if (m==n)
            return head;
        ListNode * p_ahead, *p_behind, *p_traverse;
        ListNode fakeHead(0);
        fakeHead.next = head;
        p_ahead = p_behind = &fakeHead;
        for (int i = 0; i<=n; i++)
        {
            if (i<m-1)
                p_behind = p_behind->next;
                
            p_ahead = p_ahead->next;
        }
        p_traverse = p_behind->next;
        ListNode * p_temp;
        for (int i = m; i<n; i++)
        {
            p_temp = p_traverse->next;
            p_traverse->next = p_ahead;
            p_ahead = p_traverse;
            p_traverse = p_temp;
        }
        p_behind->next = p_traverse;
        p_traverse->next = p_ahead;
        
        return fakeHead.next;
    }
};

Notes: