Merge Two Sorted Lists

最新推荐文章于 2025-09-06 09:26:50 发布

转载最新推荐文章于 2025-09-06 09:26:50 发布 · 62 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：https://my.oschina.net/gonglibin/blog/1620295

文章标签：

#python

本文介绍了一种将两个已排序的链表合并为一个新排序链表的方法。通过比较两个链表节点的值，选择较小的节点加入到新链表中，最终返回合并后的链表。示例输入为两个有序链表1->2->4和1->3->4，输出为合并后的链表1->1->2->3->4->4。

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

Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.

Example:

Input: 1->2->4, 1->3->4
Output: 1->1->2->3->4->4

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) { val = x; }
 * }
 */
class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode tmp = new ListNode(0), rst = tmp;
		
        while (null != l1 && null != l2) {
            if (l1.val <= l2.val) {
                tmp.next = l1;
                l1 = l1.next;
            }
            else {
                tmp.next = l2;
                l2 = l2.next;
            }
            tmp = tmp.next;
        }
		
        tmp.next = null != l1 ? l1 : l2;
		
        return rst.next;
    }
}

转载于:https://my.oschina.net/gonglibin/blog/1620295