题目:
思路:类似于归并排序
代码:
/**
* Definition for singly-linked list.
* public class ListNode {
* int val;
* ListNode next;
* ListNode() {}
* ListNode(int val) { this.val = val; }
* ListNode(int val, ListNode next) { this.val = val; this.next = next; }
* }
*/
class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode res=new ListNode(0);
ListNode p=res; //用于移动链表
while(l1!=null && l2!=null){
if(l1.val <= l2.val ){
p.next=l1;
p=p.next;
l1=l1.next;
}else{
p.next=l2;
p=p.next;
l2=l2.next;
}
}
while(l1!=null){
p.next=l1;
p=p.next;
l1=l1.next;
}
while(l2!=null){
p.next=l2;
p=p.next;
l2=l2.next;
}
return res.next;
}
}