力扣21——合并两个有序链表

一开始在头的处理中，确定了p1后，没有将l1或l2后移，导致下边尾插法中，p2.next = l1;直接使链表成环了，非常危险！

/**
 * Definition for singly-linked list.
 * public class ListNode {
 *     int val;
 *     ListNode next;
 *     ListNode() {}
 *     ListNode(int val) { this.val = val; }
 *     ListNode(int val, ListNode next) { this.val = val; this.next = next; }
 * }
 */
class Solution {
    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {

        if(l1==null && l2==null) return null;
        if(l1==null) return l2;
        if(l2==null) return l1;
        
        ListNode p1; //头
        ListNode p2; //尾
        
        //头
        if(l1.val <= l2.val){
            p1 = l1;
            l1 = l1.next;
        } 
        else{
            p1 = l2;
            l2 = l2.next;
        } 
        
        p2 = p1;

        //尾插法
        while(l1 != null && l2 != null){
            if(l1.val <= l2.val){
                p2.next = l1;
                p2 = p2.next;
                l1 = l1.next;
            }
            else{
                p2.next = l2;
                p2 = p2.next;
                l2 = l2.next;
            }
        }

        if(l1 != null){
            p2.next = l1;
        }

        if(l2 != null){
            p2.next = l2;
        }

        return p1;
    }
}