LeetCode | Merge Two Sorted Lists

题目

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.

分析

这种题就是争取一次bugfree了，另外，链表的题一般都要考虑下需不需要用个哨兵简化代码。

代码

public class MergeTwoSortedLists {
	public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
		ListNode dummy = new ListNode(0);
		ListNode p = dummy;
		while (l1 != null && l2 != null) {
			if (l1.val < l2.val) {
				p.next = l1;
				l1 = l1.next;
			} else {
				p.next = l2;
				l2 = l2.next;
			}
			p = p.next;
		}
		if (l1 == null) {
			p.next = l2;
		} else {
			p.next = l1;
		}
		return dummy.next;
	}
}

LeetCode | Merge Two Sorted Lists,布布扣,bubuko.com

LeetCode | Merge Two Sorted Lists

原文：http://blog.csdn.net/perfect8886/article/details/21276153