b*******e
发帖数: 123 | 1 key-value pair.
[1,2,3]-> 1
[2,4,5]-> 2
[3,9,10,5,9] -> 40
...
怎么样能比o(n)更快的找
all items contain key 3?
how about
all items contain key [1,3]? | s******7
发帖数: 1758 | 2 build up reverse index
1 -> [1,2,3]
2 -> [1,2,3],[2,4,5]
3 -> [1,2,3],[3,9,10,5,9]
search [1,3]就是求1和3的并集 |
|
