LeetCode-合并两个有序链表

将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 

示例：

输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

class Solution {
	public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
		ListNode next = new ListNode(0);
		

		if (null == l1) {
			return l2;
		}

		if (null == l2) {
			return l1;
		}

		ListNode result =next;
		
		while (null != l1 || null != l2) {

			if (null == l1) {
				next.next = l2;
				break;
			}
			if (null == l2) {
				next.next = l1;
				break;
			}
			if (l1.val > l2.val) {
				next.next = l2;
				l2 = l2.next;
			} else {
				next.next = l1;
				l1 = l1.next;
			}
			next = next.next;
		}

		return result.next;
	}
}