Merge Two Sorted Lists

medium

Acceptance: 52%

Linked List

Two sorted singly linked lists are provided. Combine them into a single sorted list by interleaving the nodes from both input lists (do not create new nodes, reuse the existing ones). Return the head of the unified sorted list.

Examples

Example 1:

Input:list1 = [2,5,9], list2 = [1,4,7]

Output:[1,2,4,5,7,9]

Example 2:

Input:list1 = [], list2 = [3]

Output:[3]

Hints

1234567

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

import java.util.*;

public class Main {
    public static void main(String[] args) {
        // Write your solution here
    }
}

Merge Two Sorted Lists

Examples

Hints

Related Problems