21题：合并两个有序链表

https://leetcode-cn.com/problems/merge-two-sorted-lists/
将两个升序链表合并为一个新的 升序 链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。
输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
		if (l1 == null) return l2;
		if (l2 == null) return l1;
		ListNode root = l1.val <= l2.val ? l1 : l2;
		ListNode p = null;
		if (l2.val < l1.val) {
			while (l2 != null && l2.val <= l1.val ) {
				p = l2;
				l2 = l2.next;
			}
			p.next = l1;
		}
        while (l1 != null && l2 != null) {
        	while (l1 != null && l1.val <= l2.val) {
            	p = l1;
        		l1 = l1.next;
        	}
        	p.next = l2;
        	if (l1 == null) return root;
        	while (l2 != null && l2.val <= l1.val) {
        		p = l2;
        		l2 = l2.next;
        	}
        	p.next = l1;
        }
        return root;
    }
}