https://leetcode.com/problems/merge-two-sorted-lists/
这用到的就是merge sort里面的merge函数,只不过这里是在merge list。
public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(0);
ListNode tvs = dummy;
while(l1!=null && l2!=null){
if(l1.val<l2.val){
tvs.next = l1;
l1 = l1.next;
}
else{
tvs.next = l2;
l2 = l2.next;
}
tvs = tvs.next;
}
if(l1!=null) tvs.next = l1;
else tvs.next = l2;
return dummy.next;
}
}