0009 合并两个有序链表

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     public int val;
 *     public ListNode next;
 *     public ListNode(int x) { val = x; }
 * }
 */
public class Solution {
    public ListNode MergeTwoLists(ListNode l1, ListNode l2) {
        ListNode p1 = l1; 
        ListNode p2 = l2;
        ListNode res = new ListNode(0);
        ListNode p = res;
        if(p1 == null && p2 == null){
            return null;
        }
        while(p1 != null || p2 != null){
            int a = p1 != null ? p1.val:Int32.MaxValue;
            int b = p2 != null ? p2.val:Int32.MaxValue;
            int min = a<b?a:b;
            if(p1!= null && min == p1.val){
                ListNode temp = new ListNode(min);
                p.next = temp;
                p = p.next;
                p1 = p1.next;
            }
            if(p2!=null && min == p2.val){
                 ListNode temp = new ListNode(min);
                p.next = temp;
                p = p.next;
                p2 = p2.next;
            }
        }
        return res.next;
    }
}