题目描述:
Merge two sorted linked lists and return it as a new list. The new list should be made by splicing together the nodes of the first two lists.
思路解析:
- 合并链表
- 一个为空,就返回另一个,否则的话进行比较,把小的拼接到新的链表后边
- 最后看看是谁还剩下了。
代码:
/**
* 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) {
if(l1==null)
return l2;
if(l2==null)
return l1;
ListNode l3;
if(l1.val<l2.val){
l3 =l1;
l1=l1.next;
}else{
l3=l2;
l2=l2.next;
}
ListNode fakehead = new ListNode(-1);
fakehead.next = l3;
while(l1!=null&&l2!=null){
if(l1.val<l2.val){
l3.next = l1;
l1=l1.next;
l3=l3.next;
}else{
l3.next = l2;
l2=l2.next;
l3=l3.next;
}
}
if(l1!=null)
l3.next =l1;
if(l2!=null)
l3.next = l2;
return fakehead.next;
}
}