/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int x) {
* val = x;
* next = null;
* }
* }
*/
public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode root,cur;
if(l1==null) return l2;
if(l2==null) return l1;
if(l1.val<l2.val){
root=l1;
cur=root;
l1=l1.next;
}
else{
root=l2;
cur=root;
l2=l2.next;
}
while(l1!=null && l2!=null){
if(l1.val<l2.val){
cur.next = l1;
cur = cur.next;
l1 = l1.next;
}
else{
cur.next = l2;
cur = cur.next;
l2 = l2.next;
}
}
while(l1!=null){
cur.next = l1;
cur = cur.next;
l1 = l1.next;
}
while(l2!=null){
cur.next = l2;
cur = cur.next;
l2 = l2.next;
}
return root;
}
}
leetcode merge-two-sorted-lists 合并两个有序链表
最新推荐文章于 2020-10-28 11:43:42 发布