Leetcode||21.Merge Two Sorted Lists

21. Merge Two Sorted Lists

• Total Accepted: 171824
• Total Submissions: 457798
• Difficulty: Easy
• Contributors: Admin

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.

这是一个归并排序，双列的归并还是好做的，多列的话，循环处理应该也行

代码如下：

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