My Normal Life
https://leetcode.com/problems/separate-black-and-white-balls/?envType=daily-question&envId=2024-10-15 To put all zeros onto left and all ones onto right, we need to swap 0 and 1 under the condition that 1 is to the left of 0. My idea is to use 2 pointers, one starts from left
https://leetcode.com/problems/maximal-score-after-applying-k-operations/?envType=daily-question&envId=2024-10-14 We need to continuously select the largest num in the list, so Priority Queue is a good choice. We also need to keep track of index of each num in the original list, since we need to modify one after
https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/description/?envType=daily-question&envId=2024-10-13 The basic idea is to merge all the lists in num and apply window sliding on it, and it mathes perfectly. Steps: * merge all the lists into one list with elements in the form of (num, listIndex), since we
https://leetcode.com/problems/the-number-of-the-smallest-unoccupied-chair/description/?envType=daily-question&envId=2024-10-11 Since we need to keep track of seat and people, using priority queue can make each insert or retrieve to O(logn). If we use a array, it requires O(n) for each operation. Use one pq to record
https://leetcode.com/problems/sort-list/description/ Since time complexity should be O(n logn), consider merge sort or quick sort; I will use merge sort. The basic idea of merge sort is: 1. do partition from the mid point recursively 2. do merge and gradually build up the sorted list
