一、题目
二、实现
/**
* 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) {
ListNode l = new ListNode(0); // 初始了一个头节点
ListNode cur = l; //用来更新链表
while(l1 != null && l2 !=null){
if(l1.val < l2.val){
cur.next = l1;
cur = cur.next;
l1 = l1.next;
}else{
cur.next = l2;
cur = cur.next;
l2 = l2.next;
}
}
if(l1 != null){
cur.next = l1;
}
if(l2 != null){
cur.next = l2;
}
return l.next; // 需跳过初始值为0的头节点
}
}