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.

目前为止提交次数最少的一次。很简单，都是LinkedList基本操作

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode(int x) {
 *         val = x;
 *         next = null;
 *     }
 * }
 */
public class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {
        ListNode newHead = new ListNode(1);
        ListNode m = l1;
        ListNode n = l2;
        ListNode p = newHead;
        
        if (l1 == null && l2 == null){
            return null;
        }
        
        
        while(m!=null || n!=null){
            if(m==null){
                p.next=new ListNode(n.val);
                n = n.next;
                p = p.next;
            }
            else if(n==null){
                p.next=new ListNode(m.val);
                m = m.next;
                p = p.next;
            }
            else if(m.val<n.val){
                p.next = new ListNode(m.val);
                m = m.next;
                p = p.next;
            }
            else if(m.val == n.val){
                p.next = new ListNode(m.val);
                p.next.next = new ListNode(n.val);
                m = m.next;
                n = n.next;
                p = p.next.next;
            }
            else{
                p.next = new ListNode(n.val);
                n = n.next;
                p = p.next;
            }
          
        }
     return newHead.next;   
    }
}