In the Leetcode Merge k Sorted Lists problem solution in C# programming Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
You are given an array of k linked-lists lists, each linked-list is sorted in ascending order.
Merge all the linked-lists into one sorted linked-list and return it.
Example 1:
Input: lists = [[1,4,5],[1,3,4],[2,6]]
Output: [1,1,2,3,4,4,5,6]
Explanation: The linked lists are:
[
1->4->5,
1->3->4,
2->6
]
merging them into one sorted list:
1->1->2->3->4->4->5->6
Constraints:
- k == lists.length
- 0 <= k <= 104
- 0 <= lists[i].length <= 500
- -104 <= lists[i][j] <= 104
- lists[i] is sorted in ascending order.
- The sum of lists[i].length will not exceed 104.
Leetcode Merge k Sorted Lists problem solution in C# programming
public class Solution {
public ListNode MergeKLists(ListNode[] lists) {
SortedList<int, int> sl = new SortedList<int, int>();
foreach(ListNode item in lists)
{
ListNode item1 = item;
while(item1 != null)
{
if(!sl.ContainsKey(item1.val)){
sl.Add(item1.val, 1);
}
else{
sl[item1.val]++;
}
item1 = item1.next;
}
}
ListNode sortedLL = new ListNode();
ListNode temp = sortedLL;
foreach(var item in sl){
int valTimes = item.Value;
for(int i = 0; i < valTimes; i++){
temp.next = new ListNode(item.Key);
temp = temp.next;
}
}
return sortedLL.next;
}
}Also read,
- Leetcode Merge k Sorted Lists problem solution in C++
- Leetcode Merge k Sorted Lists problem solution in Java
- Leetcode Merge k Sorted Lists problem solution in Python
- Leetcode Merge k Sorted Lists problem solution in C