当前位置：网站首页>Leetcode-92-reverse linked list

Leetcode-92-reverse linked list

2022-04-22 20:45:00 【Own platform 9 and 3 / 4】

1. Problem description
https://leetcode-cn.com/problems/reverse-linked-list-ii/

  1. Solution code 
public class Solution {
    public ListNode ReverseBetween(ListNode head, int left, int right) {

        //  Set up  dummyNode  It's the general approach to this kind of problem 
        ListNode dummyNode = new ListNode(-1);
        dummyNode.next = head;
        ListNode pre = dummyNode;
        for (int i = 0; i < left - 1; i++) {
            pre = pre.next;
        }
        ListNode cur = pre.next;
        ListNode next;
        for (int i = 0; i < right - left; i++) {
            next = cur.next;
            cur.next = next.next;
            next.next = pre.next;
            pre.next = next;
        }
        return dummyNode.next;
    }
}

版权声明
本文为[Own platform 9 and 3 / 4]所创，转载请带上原文链接，感谢
https://yzsam.com/2022/04/202204222044174696.html

边栏推荐

猜你喜欢

随机推荐