问题描述
将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入:1->2->4, 1->3->4
输出: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) {
if(null == l1){
return l2;
}
if(null == l2){
return l1;
}
ListNode root = new ListNode(0);
ListNode cur = root;
while(null != l1 || null != l2){
boolean getL2 = null == l1 || (null != l2 && l2.val < l1.val);
cur.next = new ListNode(getL2 ? l2.val : l1.val);
cur = cur.next;
if(getL2){
l2 = l2.next;
}else{
l1 = l1.next;
}
}
return root.next;
}
}