Merge two sorted linked lists and return it as a new sorted list. The new list should be made by splicing together the nodes of the first two lists. Example: Input: 1->2->4, 1->3->4 Output: 1->1->2->3->4->4 Solution 1: public class Solution { public ListNode mergeTwoLists(ListNode l1, ListNode l2) { ListNode p1 = l1; ListNode p2 = l2; ListNode…… Continue reading Leetcode 21 Merge Two Sorted Lists Java Solution
Tag: Sorting Algorithms
Leetcode 56 Merge Intervals (Java)
Given a collection of intervals, merge all overlapping intervals. Example 1: Input: [[1,3],[2,6],[8,10],[15,18]] Output: [[1,6],[8,10],[15,18]] Explanation: Since intervals [1,3] and [2,6] overlaps, merge them into [1,6]. Solution: We can solve this by comparing the start of the next interval with the end of the current interval and merged if the start of the next interval…… Continue reading Leetcode 56 Merge Intervals (Java)
Leetcode 23: Merge K Sorted Lists (Java)
Merge k sorted linked lists and return it as one sorted list. Analyze and describe its complexity. Example: Input: [ 1->4->5, 1->3->4, 2->6 ] Output: 1->1->2->3->4->4->5->6 Solution: For this problem, the brute force solution would be passing all the lists and perform Merge Sort, but for the optimal solution we will use minHeap using…… Continue reading Leetcode 23: Merge K Sorted Lists (Java)