首页 > 代码库 > leetcode--Merge Two Sorted Lists

leetcode--Merge Two Sorted Lists

2024-07-07 07:06:02   215人阅读

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.

?
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
/**
 * 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 newHead = new ListNode(0);
        ListNode currentNode = newHead;
        while(l1 != null && l2 != null){
            if(l1.val <= l2.val){
                currentNode.next = l1;
                l1 = l1.next;
            }
            else{
                currentNode.next = l2;
                l2 = l2.next;
            }
            currentNode = currentNode.next;
        }
        if(l1 != null)
            currentNode.next = l1;
        else
            currentNode.next = l2;
        return newHead.next;   
    }
}

　　


联系
我们