思路:比较两个List从头的大小,小的放在前面,大的放在后面
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(0);
ListNode cur = dummy;
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 = l2;
} else {
cur.next = l1;
}
return dummy.next;
}
}