LeetCode OJ
Problems
Pick One!
Submissions
Sign up
Sign in
Merge k Sorted Lists
AC Rate: 865/3897
My Submissions
Merge
k
sorted linked lists and return it as one sorted list. Analyze and describe its complexity.
C++
Java
/** * Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(NULL) {} * }; */ class Solution { public: ListNode *mergeKLists(vector<ListNode *> &lists) { // Note: The Solution object is instantiated only once and is reused by each test case. } };
/** * Definition for singly-linked list. * public class ListNode { * int val; * ListNode next; * ListNode(int x) { * val = x; * next = null; * } * } */ public class Solution { public ListNode mergeKLists(ArrayList<ListNode> lists) { // Note: The Solution object is instantiated only once and is reused by each test case. } }
Submit Solution
You have not signed in, cannot submit your code.
Submit failed, try again please.
You have attempted to resubmit too soon. Please resubmit in a moment.
Send Feedback