在PAT裏使用map還是unordered_map?

時間複雜度 O(?) map unordered_map Ordering increasing order no ordering Implementation Self balancing BST(Red-Black Tree) Hash Table search time log(n) O(1) -> Average ,O(n) -> Worst Case Insertion time lo

>>阅读原文<<