剑指offer25
/**
* 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) {
if(l1==null&&l2==null) return null;
if(l1==null) return l2;
if(l2 == null) return l1;
//创造一个伪头结点
ListNode newHead = new ListNode(0);
//指向插入下一个的位置
ListNode next = newHead;
//如果其中有一个链表遍历完成,即可退出while
while(l1!=null && l2!=null){
if(l1.val<=l2.val){
next.next = l1;
l1 = l1.next;
}else{
next.next = l2;
l2 = l2.next;
}
next = next.next;
}
//当退出while后,将剩下的链表的数据直接插入
next.next = l1 ==null ? l2:l1;
//返回的Node需要除去newHead
return newHead.next;
}
}