Leetcode - Reversed Linked ListII

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 ≤ mn ≤ length of list.

 

public ListNode reverseBetween(ListNode head, int m, int n) {
        // Start typing your Java solution below
        // DO NOT write main() function
        if(m == n)
            return head;
            
        ListNode pBefore = new ListNode(-1);
        pBefore.next = head;
        ListNode prev, curr = head,next;
        
        int c = 1;
        while(c < m){
            pBefore = pBefore.next;
            c++;
        }
        
        ListNode mNode = pBefore.next;
        prev = pBefore.next;
        curr = prev.next;
        while(c < n){
            next = curr.next;
            curr.next = prev;
            prev = curr;
            curr = next;
            c++;
        }
        pBefore.next = prev;
        mNode.next = curr;
        
        return mNode == head ? pBefore.next : head;
    }

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值