unordered_map<int, Node*> mp;if
(mp.find(key) == mp.end())unordered_map<int, Node*>::iterator it = mp.find(deltmp->key);mp.erase(it);mp.clear();map[k]++ //也覆盖了一开始count为0的情况for
(unordered_map<float, int>::iterator it = mp.begin(); it != mp.end(); it++) {int
result = num_stack.top();num_stack.pop();#define pp pair<int, char>priority_queue<pp, vector<pp>, greater<pp> > que;set<char> visit;if
(visit.count(node) != 0) continue;visit.insert(node); |
原文：http://www.cnblogs.com/lautsie/p/3512702.html