数据结构合并两个链表力扣

jalilzod

已于 2024-05-04 00:46:02 修改

阅读量185

点赞数 6

分类专栏：力扣文章标签：数据结构链表 leetcode

于 2024-05-02 16:01:23 首次发布

本文链接：https://blog.csdn.net/jalilzod/article/details/138393683

版权

力扣专栏收录该内容

15 篇文章 0 订阅

订阅专栏

这篇文章提供了一个Java类Solution，用于合并两个已排序的链表，通过比较节点值并按顺序连接它们。函数`mergeTwoLists`处理了空列表和非空列表的各种情况。

摘要由CSDN通过智能技术生成

21. Merge Two Sorted Lists

You are given the heads of two sorted linked lists list1 and list2.

Merge the two lists into one sorted list. The list should be made by splicing together the nodes of the first two lists.

Return the head of the merged linked list.

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    private ListNode l3 = new ListNode();
    public ListNode mergeTwoLists(ListNode list1, ListNode list2) {
        
        if(isEmpty(list1)&&isEmpty(list2))
          return null;
        else if(isEmpty(list1)&&!isEmpty(list2))
          return list2;
        else if(!isEmpty(list1)&&isEmpty(list2))
          return list1;
        else {

            int l1 = 0,i = 0;
            while(!isEmpty(list1)&&!isEmpty(list2)){
                
                if(i%2==0){
                if(isGreat(list1.val,list2.val)){
                merge(list1.val);
                list1 = list1.next;
                l1 = 1;
                }else{
                merge(list2.val);
                list2 = list2.next;
                l1 = 0;
                }
             }else
             {
                if(l1==1){
                merge(list2.val);
                list2 = list2.next;
                l1 = 0;
                }else
                {
                merge(list1.val);
                list1 = list1.next; 
                }

             }
            

            if(isEmpty(list1)&&!isEmpty(list2)){
                while(!isEmpty(list2)){
                merge(list2.val);
                list2 = list2.next;
                }
            }else if(!isEmpty(list1)&&isEmpty(list2)){
                while(!isEmpty(list1)){
                merge(list1.val);
                list1 = list1.next;
                }
            }

    }
      
        }

    return l3=l3.next;
    }

    public boolean isGreat(int a,int b){
        return a<=b;
    }

    public void merge(int val){
        ListNode newNode = new ListNode();
        newNode.val = val;
        newNode.next = null;
        if(l3==null){
            l3 = newNode;
        }else
        {
            ListNode tmp = l3;
            while(tmp.next!=null){
                tmp = tmp.next;
            }
            tmp.next = newNode;
        }
    }


    public boolean isEmpty(ListNode l){
        return l==null;
    }
}