/*
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;
else if (list2 == null)
return list1;
ListNode ML = null;
if(list1.val < list2.val){
ML = list1;
ML.next = Merge(list1.next,list2);
}
else{
ML = list2;
ML.next = Merge(list1,list2.next);
}
return ML;
}
}
剑指offer25 合并两个排序的链表
最新推荐文章于 2023-03-12 20:52:19 发布