[Leetcode] Merge Two Sorted Lists (Java)

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; *         next = null; *     } * } */public class Solution {    public ListNode mergeTwoLists(ListNode l1, ListNode l2) {ListNode res = new ListNode(-1);ListNode temp = res;while(l1!=null&&l2!=null){if(l1.val<l2.val){temp.next=l1;l1=l1.next;}else {temp.next=l2;l2=l2.next;}temp=temp.next;}while(l1!=null){temp.next=l1;l1=l1.next;temp=temp.next;}while(l2!=null){temp.next=l2;l2=l2.next;temp=temp.next;}return res.next;            }}