题目:
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; }
* }
*/
public class Solution {
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
//处理特殊情况
if(l1 == null && l2 == null){
return null;
}else if(l1 == null){
return l2;
}else if(l2 == null){
return l1;
}
ListNode head = new ListNode(-1);
ListNode t = head;
while(l1!=null && l2!=null){
if(l1.val <= l2.val){
t.next = l1;
l1 = l1.next;
}else{
t.next = l2;
l2 = l2.next;
}
t = t.next;
}
if(l1 != null){
t.next = l1;
}
if(l2 != null){
t.next = l2;
}
return head.next;
}
}
【16.3.1补充】
在看剑指offer的时候看到了这个题目,书中的方法是用递归,以后也可以实现这种方法。