1.问题描述
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。
实例:
输入:1->2->4, 1->3->4
输出:1->1->2->3->4->4
2.解决思路
/*** 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) {//定义dum为融合链表后的首节点;ListNode dum = new ListNode(0);ListNode cur = dum;while (l1 != null && l2!=null ){if (l1.val >= l2.val){cur.next = l2;l2 = l2.next;}else{cur.next = l1;l1 = l1.next;}cur = cur.next;}if (l1 != null){cur.next = l1;}else{cur.next = l2;}return dum.next;}
}