/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) { val = x; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode preHead= new ListNode(-1);
ListNode prePoint=preHead;
ListNode Temp=new ListNode(-1);
while(l1!=null&&l2!=null){
if(l1.val<l2.val){
Temp=l1;
l1=l1.next;
}
else{
Temp=l2;
l2=l2.next;
}
preHead.next=Temp;
preHead=preHead.next;
}
while(l1!=null){
Temp=l1;
l1=l1.next;
preHead.next=Temp;
preHead=preHead.next;
}
while(l2!=null){
Temp=l2;
l2=l2.next;
preHead.next=Temp;
preHead=preHead.next;
}
return prePoint.next;
}
}
算法系列------合并两个有序链表
最新推荐文章于 2024-07-06 19:08:33 发布