LeetCode - 92. 反转链表 II

反方向的钟49

已于 2023-04-11 11:56:33 修改

阅读量149

点赞数

文章标签：链表 leetcode 数据结构

于 2023-04-08 00:47:26 首次发布

本文链接：https://blog.csdn.net/qq_43544430/article/details/130023464

版权

给你单链表的头指针head和两个整数left和right，其中left <= right。请你反转从位置left到位置right的链表节点，返回反转后的链表。
在这里插入图片描述
提示：

链表中节点数目为n
1 <= n <= 500
-500 <= Node.val <= 500
1 <= left <= right <= n

/**
 * Definition for singly-linked list.
 * struct ListNode {
 *     int val;
 *     struct ListNode *next;
 * };
 */


struct ListNode* reverseBetween(struct ListNode* head, int left, int right){
    if( left == right )
        return head;
    struct ListNode *p, *q, *r, *s;
    p = q = r = s = NULL;
    int cnt = 0;
    struct ListNode *temp;
    for( struct ListNode *cur = head; cur; cur = temp ) {
        temp = cur->next;
        struct ListNode *pre;
        cnt ++;
        if( cnt < left - 1 )
            continue;
        else if( cnt == left - 1 )
            p = cur;
        else if( cnt == left )
            q = pre = cur;
        else if( cnt > left && cnt <= right ) {
            if( cnt == right )
                r = cur;
            cur->next = pre;
            pre = cur;
        } else if( cnt == right + 1 ) {
            s = cur;
            break;
        }
    }
    q->next = s;
    if( p ) {
        p->next = r;
        return head;
    } else
        return r;
}