合并两个有序链表

 

合并两个有序链表

将两个有序链表合并为一个新的有序链表并返回。新链表是通过拼接给定的两个链表的所有节点组成的。 

示例：

输入：1->2->4, 1->3->4
输出：1->1->2->3->4->4

/**
 * 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 head = new ListNode(0);
        ListNode cur = head;
        while (l1 != null && l2 != null)
        {
            if (l1.val <l2.val)
            {
                cur.next = l1;
                cur = l1;
                l1 = l1.next;
            }else
            {
                cur.next = l2;
                cur = l2;
                l2 = l2.next;
            }
        }

        if (l1 == null)
        {
            cur.next = l2;
        }
        if (l2 == null)
        {
            cur.next = l1;
        }

        return head.next;
    }
}

递归，，，

/**
 * 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) {
        if (l1 == null) return l2;
        if (l2 == null) return l1;
        ListNode head = null;
        if (l1.val <= l2.val){
            head = l1;
            head.next = MergeTwoLists(l1.next, l2);
        } else {
            head = l2;
            head.next = MergeTwoLists(l1, l2.next);
        }
        return head;

    }
}