将两个有序链表重新排序,合并为一个新的有序链表并返回
//将两个有序链表合并为一个新的有序链表并返回
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
if (l1 == null) {
//链表是否1为null
return l2;
} else if (l2 == null) {
//链表2是否为null
return l1;
}
//创建新链表
ListNode newHead = new ListNode(0);
ListNode node = newHead;
while (l1 != null && l2 != null) {
if (l1.val <= l2.val) {
node.next = l1;
node = node.next;
l1 = l1.next;
} else {
node.next = l2;
node = node.next;
l2 = l2.next;
}
}
//链表长度不一样长
if (l1 == null) {
node.next = l2;
} else {
node.next = l1;
}
return newHead.next;
}
}