Phantomape的博客

DescriptionDesign a data structure that supports all following operations in average O(1) time.Note: Duplicate elements are allowed. insert(val): Inserts an item val to the collection. remove(val): R

lower bound and upper bound function in STL

Reconstruct original digits from english

LRU Cache and LFU Cache

Given a non-empty array of integers, return the k most frequent elements.

Algorithm

Reservoir sampling

Permutations

LeetCode: Palindrome Pairs

This problem is quite similar the concept in digital circuit. First let us take a look at the code:public int singleNumber(int[] A) { if(A.length==0) { return 0; }