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.

1.递归

/**
 * 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) {
        if(l1==null) return l2;
        if(l2==null) return l1;
        ListNode l=new ListNode(0);
        if(l1.val<l2.val){
            l=l1;
            l.next=mergeTwoLists(l1.next,l2);
        }
        if(l1.val>=l2.val){
            l=l2;
            l.next=mergeTwoLists(l1,l2.next);
        }
        return l;
        }
       
}

2.迭代

/**
 * 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) {
        if(l1==null&&l2==null)
        return null;
        ListNode l=new ListNode(0);
        ListNode head=l;      //保留现场
        while(l1!=null||l2!=null){
        if(l1==null) 
            while(l2!=null){
                l.next=l2;
                l=l.next;   //创建新节点
                l2=l2.next;
               }
        if(l2==null) 
        while(l1!=null){
                l.next=l1;
                l=l.next;
                l1=l1.next;
               }
        if(l1!=null&&l2!=null&&l1.val<l2.val){
            l.next=l1;
            l=l.next;
            l1=l1.next;
        }
        else if(l1!=null&&l2!=null&&l1.val>=l2.val){
            l.next=l2;
            l=l.next;
            l2=l2.next;
        }
        }
        return head.next;
        }
       
    }