合并两个排序链表
题目
将两个排序链表合并为一个新的排序链表
样例
给出1->3->8->11->15->null,2->null,返回 1->2->3->8->11->15->null。
题解
/**
* Definition for ListNode.
* public class ListNode {
* int val;
* ListNode next;
* ListNode(int val) {
* this.val = val;
* this.next = null;
* }
* }
*/
public class Solution {
/**
* @param ListNode l1 is the head of the linked list
* @param ListNode l2 is the head of the linked list
* @return: ListNode head of linked list
*/
public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
ListNode dummy = new ListNode(0);
ListNode lastNode = dummy;
while (l1 != null && l2 != null)
{
if (l1.val < l2.val)
{
lastNode.next = l1;
l1 = l1.next;
}
else
{
lastNode.next = l2;
l2 = l2.next;
}
lastNode = lastNode.next;
}
lastNode.next = l1 == null ? l2 : l1;
return dummy.next;
}
}
Last Update 2016.9.7