再见小小ronnie的博客

public class Solution { public void heapify(int[] A) { // only heapify the parent nodes which range is [0, A.length-1/2] // from bottom to up, call minHeapify() for (int i=

O(mlogn), m is number of columns and n is number of rows. O(m*n) space. Merge the matrix into an array, return kth element. public class Solution { public int kthSmallest(int[][] matrix, int k)

Two heap to save the smaller half and larger half number respectively.  We need to keep heap as balanced while insertion, i.e., the different of two heaps' size must be If we find the insertion wil

public class Solution { public int thirdMax(int[] nums) { // Hashset to remove all duplicate elements HashSet set = new HashSet(); for (int num : nums) set.add(

Data structure used, hash table and min heap. A hashmap to save every element along with its frequency for the input data. A min heap to save top k most frequent map entry, comparing by map.value th