Why is vector faster than unordered_map?
问题 I am solving a problem on LeetCode, but nobody has yet been able to explain my issue. The problem is as such: Given an arbitrary ransom note string and another string containing letters from all the magazines, write a function that will return true if the ransom note can be constructed from the magazines ; otherwise, it will return false. Each letter in the magazine string can only be used once in your ransom note. Note: You may assume that both strings contain only lowercase letters.