剑指offer——合并两个排序的链表__

题目描述

/*
public class ListNode {
int val;
ListNode next = null;

ListNode(int val) {
this.val = val;
}
}*/
public class Solution {
public ListNode Merge(ListNode list1,ListNode list2) {
if(list1==null)return list2;
if(list2==null)return list1;

ListNode head1 = list1;
ListNode head2 = list2;

ListNode v = new ListNode(-1);
ListNode p = v;
while(head1!=null&&head2!=null){
if(head1.val<head2.val){
p.next =head1;
head1=head1.next;
p = p.next;
}else {
p.next = head2;
head2 = head2.next;
p = p.next;
}
}//while
if(head1==null){
p.next =head2;
}else {
p.next = head1;
}
return v.next;
}
}