- 博客(1)
- 收藏
- 关注
转载 Mo's Algorithm
This algorithm can solve some difficult data structure problems. Like this: Give an array a[] of size N, we query Q times. Each time we want to get the mode number(the value that appears most often in
2016-01-29 15:55:18 737
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人