题目:
输入两个递增排序的链表,合并这两个链表并使新链表中的节点仍然是递增排序的。如:
链表1:1->3->5->7
链表2:2->4->6->8
合并后:1->2->3->4->5->6->7->8
比较头结点大小即可
public static ListNode merge(ListNode head1, ListNode head2) {
if (head1 == null) {
return head2;
} else if (head2 == null) {
return head1;
}
ListNode mergeHead = null;
if (head1.val < head2.val){
mergeHead = head1;
mergeHead.next = merge(head1.next,head2);
}else {
mergeHead = head2;
mergeHead.next = merge(head1,head2.next);
}
return mergeHead;
}