Java [Leetcode 21]merge-Sorted Lists

Title Description:

Merge sorted linked lists and return it as a new list. The new list should is made by splicing together the nodes of the first of the lists.

Problem Solving Ideas:

The title means to synthesize an ordered list of two ordered linked lists.

Add to the new list by comparison.

The code is as follows:

public static ListNode mergetwolists (ListNode L1, ListNode L2) {ListNode list = new ListNode (0);  ListNode tmp = list;while (L1! = NULL | | L2! = NULL) {if (L1 = = null) {Tmp.next = new ListNode (l2.val); l2 = L2.next;} else if (L2 = = null) {Tmp.next = new ListNode (l1.val); l1 = L1.next;} else {if (L1.val < l2.val) {tmp.next = new ListNode (L1 . val); l1 = L1.next;} else {tmp.next = new ListNode (l2.val); l2 = L2.next;}} TMP = Tmp.next;} return list.next;}

Java [Leetcode 21]merge-Sorted Lists