Merge Two Sorted Lists --leetcode

最新推荐文章于 2025-09-08 10:56:58 发布

转载最新推荐文章于 2025-09-08 10:56:58 发布 · 81 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://my.oschina.net/u/2277632/blog/1590367

文章标签：

#python

本文提供了一种合并两个已排序链表的有效算法实现。通过创建一个新的虚拟头结点，遍历两个输入链表并按升序连接节点，最终返回合并后的链表。此方法简洁高效，易于理解和实现。

2019独角兽企业重金招聘Python工程师标准>>>

package com.helloxin.leetcode.algorithms;

import com.helloxin.leetcode.algorithms.preparation.ListNode;

/**
 * create by nandiexin on 2017/12/14
 **/
public class MergeTwoSortedLists {


    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode prehead = new ListNode(-1);

        ListNode prev = prehead;
        while (l1 != null && l2 != null) {
            if (l1.val <= l2.val) {
                prev.next = l1;
                l1 = l1.next;
            } else {
                prev.next = l2;
                l2 = l2.next;
            }
            prev = prev.next;
        }

        // exactly one of l1 and l2 can be non-null at this point, so connect
        // the non-null list to the end of the merged list.
        prev.next = l1 == null ? l2 : l1;
        return  prev.next;
    }

    public static void main(String[] args) {

    }
}

https://github.com/woshiyexinjie/leetcode-xin

转载于:https://my.oschina.net/u/2277632/blog/1590367