public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode s1 , s2;
if(l1 == null && l2 != null){
return l2;
}else if(l1 != null && l2 == null){
return l1;
}else if(l1 == null && l2 == null){
return null;
}
if(l1.val > l2.val){
s1 = l2;
s2 = l1;
}else{
s1 = l1;
s2 = l2;
}
ListNode tmpRes = s1;
ListNode tmpRes1 = s1;
ListNode res = tmpRes;
while(s1 != null && s2 != null){
if(s1.val <= s2.val){
tmpRes = s1;
s1 = s1.next;
}else{
tmpRes = s2;
s2 = s2.next;
}
tmpRes1.next = tmpRes;
tmpRes1 = tmpRes;
tmpRes = tmpRes.next;
}
if(s1 != null){
tmpRes = s1;
tmpRes1.next = tmpRes;
tmpRes1 = tmpRes;
tmpRes = tmpRes.next;
s1 = s1.next;
}
while(s2 != null){
tmpRes = s2;
tmpRes1.next = tmpRes;
tmpRes1 = tmpRes;
tmpRes = tmpRes.next;
s2 = s2.next;
}
return res;
}
}
这么基本的题目做了差不多一天
Merge Two Sorted Lists
最新推荐文章于 2024-01-12 14:30:52 发布