Node merge(Node head1, Node head2) {
if(head1==null)
return head2;
if(head2==null)
return head1;
Node p1 = head1;
Node p2 = head2;
Node ret = null;
if(p1.data < p2.data){
ret = p1;
ret.next = merge(p1.next, p2);
}
else{
ret = p2;
ret.next = merge(p1, p2.next);
}
return ret;
}
Merge Two Sorted Lists
最新推荐文章于 2024-02-04 15:23:14 发布