题目描述:合并两个有序链表,返回一个新链表。
题目链接:Leetcode 21. Merge Two Sorted Lists
就是外排思想,最后考虑长度较长的一方,直接拼接原链,不用new LISTNODE。
代码如下
/**
* 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 ans = new ListNode(0);
ListNode p = ans;
while(l1 != null && l2 != null) {
if (l1.val < l2.val) {
p.next = l1;
l1 = l1.next;
p = p.next;
}else{
p.next = l2;
l2 = l2.next;
p = p.next;
}
}
ListNode res = (l1 == null) ? l2 : l1;
while (res != null){
p.next = res;
res = res.next;
p = p.next;
}
return ans.next;
}
}