这次的题目在算法上没有什么花里胡哨的处理,只要理解了链表就可以根据简单的逻辑实现代码
ListNode l3 = new ListNode(0);
ListNode s = l3;
while(l1!=null&&l2!=null)
{
if(l1.val<=l2.val)
{
s.next = l1;
l1 = l1.next;
}
else
{
s.next = l2;
l2 = l2.next;
}
s = s.next;
}
if(l1==null) l1=l2;
while(l1!=null)
{
s.next = l1;
l1 = l1.next;
s = s.next;
}
return l3.next;