【LeetCode】21. 合并两个有序链表

题目

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

---

代码

/**
 * 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 list1, ListNode list2) {
        ListNode lists = new ListNode(0);
        ListNode list = lists;
        while (list1 != null && list2 != null) {
            if (list1.val <= list2.val) {
                list.next = list1;
                list1 = list1.next;
                list = list.next;
            } else {
                list.next = list2;
                list2 = list2.next;
                list = list.next;
            }
        }
        if (list1 != null) {
            list.next = list1;
            list1 = list1.next;
            list = list.next;
        }
        if (list2 != null) {
            list.next = list2;
            list2 = list2.next;
            list = list.next;
        }
        ListNode node = lists.next;
        return node;
    }
}