C++:unordered map底层是hash表,map底层是红黑树
Java:HashMap
unordered map用法:(Leetcode#1)
class Solution {
public:
vector<int> twoSum(vector<int>& nums, int target) {
int i=0;int j=0;
vector<int> result;
unordered_map<int,int>map;
for(i=0;i<nums.size();i++){
int complement = target - nums[i];
auto it = map.find(complement);
if(it!=map.end()){
result.push_back(i);
result.push_back(it->second);
break;
}
map[nums[i]]=i;
}
return result;
}
};