Loading docs/ds/stl/map.md +1 −1 Original line number Diff line number Diff line Loading @@ -78,7 +78,7 @@ if(iter->first=="Tom") mp.erase(iter);//这里的iter是迭代器, ### `map` 常数靠得住吗? 一般情况下是可以的。无论查询,插入,删除的复杂度都是 $O(logN)$,遍历是 $O(N)$。 一般情况下是可以的。无论查询,插入,删除的复杂度都是 $O(\log N)$,遍历是 $O(N)$。 不过有的时候不会满足啊!我只想查询元素,插入元素,但是时间不够咋办?请往下看! Loading mkdocs.yml +1 −0 Original line number Diff line number Diff line Loading @@ -113,6 +113,7 @@ nav: - STL 简介: ds/stl.md - vector: ds/stl/vector.md - priority_queue: ds/stl/priority_queue.md - map: ds/stl/map.md - pb_ds: - pb_ds 简介: ds/pb-ds/index.md - priority_queue: ds/pb-ds/priority-queue.md Loading Loading
docs/ds/stl/map.md +1 −1 Original line number Diff line number Diff line Loading @@ -78,7 +78,7 @@ if(iter->first=="Tom") mp.erase(iter);//这里的iter是迭代器, ### `map` 常数靠得住吗? 一般情况下是可以的。无论查询,插入,删除的复杂度都是 $O(logN)$,遍历是 $O(N)$。 一般情况下是可以的。无论查询,插入,删除的复杂度都是 $O(\log N)$,遍历是 $O(N)$。 不过有的时候不会满足啊!我只想查询元素,插入元素,但是时间不够咋办?请往下看! Loading
mkdocs.yml +1 −0 Original line number Diff line number Diff line Loading @@ -113,6 +113,7 @@ nav: - STL 简介: ds/stl.md - vector: ds/stl/vector.md - priority_queue: ds/stl/priority_queue.md - map: ds/stl/map.md - pb_ds: - pb_ds 简介: ds/pb-ds/index.md - priority_queue: ds/pb-ds/priority-queue.md Loading