题解 | #排序#
合并有序链表
http://www.nowcoder.com/practice/a479a3f0c4554867b35356e0d57cf03d
import java.util.*;
/*
* public class ListNode {
* int val;
* ListNode next = null;
* }
*/
public class Solution {
/**
*
* @param l1 ListNode类
* @param l2 ListNode类
* @return ListNode类
*/
public ListNode mergeTwoLists (ListNode l1, ListNode l2) {
ListNode res = new ListNode(0);
ListNode curr = res;
while (l1 != null && l2 != null)
{
if (l1.val < l2.val)
{
curr.next = l1;
l1 = l1.next;
}
else
{
curr.next = l2;
l2 = l2.next;
}
curr = curr.next;
}
if (l1 == null)
{
curr.next = l2;
}
else if (l2 == null)
{
curr.next = l1;
}
return res.next;
}
} 
