每天一道算法题。
树状数组：
- lintcode 532 reverse pairs
- lintcode 1293 count of range sum
- lintcode 1297 count of smaller number after self
广度优先搜索：
深度优先搜索
深度优先搜索（排列型）
深度优先搜索（组合型）
栈、队列和优先队列（堆）
- lintcode 81 find median from data stream
- lintcode 122 largest rectangle in histogram
- lintcode 362 sliding window maximum
- lintcode 612 k closest points
- lintcode 486 merge k sorted arrays
- leetcode 1046 last stone weight
并查集
- lintcode 434 number of islands ii
- lintcode 590 connecting graph ii
- lintcode 629 minimum spanning tree
同向双指针
- lintcode 928 longest substring with at most two distinct characters
- lintcode 32 minimum-window-substring
相向双指针
二分查找
区间动态规划
拓扑排序