题目描述
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
思路
比较简单的双指针问题,直接用两个指针,从各自头节点出发,当前较小值加入新链表。
代码
public static ListNode2 mergeTwoLists(ListNode2 list1, ListNode2 list2) {
ListNode2 cur1 = list1;
ListNode2 cur2 = list2;
//if(cur1==null)return list2;
//if(cur2==null)return list1;
ListNode2 head = new ListNode2(0);
//cur1.val>=cur2.val?cur1:cur2;
ListNode2 cur = head;
while((cur1!=null)&&cur2!=null){
if(cur1.val<=cur2.val){
cur.next = cur1;
cur1 = cur1.next;
cur = cur.next;
}else {
cur.next = cur2;
cur2 = cur2.next;
cur = cur.next;
}
}
if(cur1==null){
while(cur2!=null){
cur.next = cur2;
cur = cur.next;
cur2 = cur2.next;
}
}
if(cur2==null){
while(cur1!=null){
cur.next = cur1;
cur = cur.next;
cur1 = cur1.next;
}
}
return head.next;
}