BM2 链表内指定区间反转(LeetCode Java)

最新推荐文章于 2023-09-01 20:33:08 发布

z_ph

最新推荐文章于 2023-09-01 20:33:08 发布

阅读量167

点赞数 1

分类专栏： LeetCode 文章标签：链表 leetcode java

本文链接：https://blog.csdn.net/m0_53892170/article/details/126684285

版权

LeetCode 专栏收录该内容

3 篇文章 0 订阅

订阅专栏

在这里插入图片描述

import java.util.*;

/*
 * public class ListNode {
 *   int val;
 *   ListNode next = null;
 * }
 */

public class Solution {
    /**
     * 
     * @param head ListNode类 
     * @param m int整型 
     * @param n int整型 
     * @return ListNode类
     */
    public ListNode reverseBetween (ListNode head, int m, int n) {
        // write code here
                if (head == null) {
            return null;
        }
        ListNode l1 = head;
        if(m-2<0){
            l1 = null;
        }
        for (int i = 0; i < m - 2; i++) {
            l1 = l1.next;
        }
        ListNode l2 = head;
        for (int i = 0; i < n; i++) {
            l2 = l2.next;
        }
        ListNode l3 = head;
        for (int i = 0; i < m-1; i++) {
            l3=l3.next;
        }
        ListNode l4 = null;
        ListNode l5 = l3;
        ListNode l6 = l3.next;
        for (int i = 0; i < n - m + 1; i++) {
            l5.next = l4;
            l4 = l5;
            l5 = l6;
            if(l6!=null){
                l6 = l6.next;
            }

        }
        if(l1==null){
            head = l4;
        }else {
            l1.next = l4;
        }

        l3.next = l2;

        return head;
    }
}