将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
示例:
输入: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() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode res = new ListNode();
ListNode head = res;
while(l1 != null && l2 != null){
if(l1.val <= l2.val){
res.next = l1;
l1 = l1.next;
}else{
res.next = l2;
l2 = l2.next;
}
res = res.next;
}
res.next = l1 != null?l1:l2;
return head.next;
}
}