剑指offer---16---合并排序好的链表
题意
两个链表排好序列了，要将他们合并起来
分析
做一个前置的节点指向第一个节点
dummy
cur指向dummy
代码
/*
public class ListNode {
int val;
ListNode next = null;
ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode Merge(ListNode list1,ListNode list2) {
ListNode dummy = new ListNode(0);
ListNode cur = dummy;
while(list1!=null && list2!=null){
if(list1.val < list2.val){
cur.next = list1;
list1 = list1.next;
cur = cur.next;
}else{
cur.next = list2;
list2 = list2.next;
cur = cur.next;
}
}
if(list1 != null){cur.next = list1;}
if(list2 != null){cur.next = list2;}
return dummy.next;
}
}
