xutian_curry的博客

考察点：map的常见使用#include <set>#include <vector>#include <map>using namespace std;class Solution {public: vector<int> intersect(vector<int>& nums1, vector<int&...

用unorderdmap 即可 ，否则会超时#include <iostream>#include <memory.h>#include <math.h>#include <stdio.h>#include <unordered_map>#include <string>#include <map>u

#include <iostream>#include <memory.h>#include <math.h>#include <stdio.h>#include <unordered_map>#include <string>#include <map>using namespace std;ma

#include <set>class Solution {public: bool containsNearbyDuplicate(vector<int>& nums, int k) { unordered_set<int> record; for( int i = 0; i < nums.s...

#include <set>#include <algorithm>#include <string>#include <string.h>using namespace std;class Solution{public: bool isValidSudoku(vector<vector<char>>&...

#include <set>#include <algorithm>using namespace std;class Solution{public: vector<vector<int>> fourSum(vector<int>& nums, int target) { if(nums...

注意边界#include <map>#include <queue>#include <set>#include <algorithm>#include <memory.h>using namespace std;class Solution {public: int lengthOfLongestSubstring...

遍历每个i，把剩余点与i的距离做key放入map，value是具有相同距离的点的个数#include <map>#include <queue>#include <set>#include <algorithm>using namespace std;class Solution{public: int numberOfBoom...

把C和D的所有组合放入到查找表中#include <map>#include <queue>#include <set>#include <algorithm>using namespace std;class Solution {public: int fourSumCount(vector<int>& A,...

#include <map>#include <queue>#include <set>#include <algorithm>using namespace std;class Solution{public: vector<vector<int>> threeSum(vector<int>

key是数，value是索引，注意key需要重复，用multimap#include <map>#include <queue>using namespace std;class Solution {public: vector<int> twoSum(vector<int>& nums, int target) {...

#include <map>#include <queue>using namespace std;struct node { char c; int num; friend bool operator <(const node &a,const node &b) { return a.num &...

#include <unordered_map>using namespace std;class Solution {public: bool isIsomorphic(string s, string t) { unordered_map<char,char> mymap; for(int i=0;i<s.size...

#include <unordered_map>#include <iostream>#include <string>using namespace std;class Solution {public: bool wordPattern(string pattern, string str) { istrin...

用一个unorderedmap 去存已经出现的数#include <unordered_set>using namespace std;class Solution {public: bool isHappy(int n) { unordered_set<int> s; while(s.find(n)==s.end()...

#include <unordered_map>#include <string>using namespace std;class Solution {public: bool isAnagram(string s, string t) { unordered_map<char,int> mymap; ...

map,  用实力值当做关键字#include <iostream>#include <memory.h>#include <map>#include <stdio.h>#define IN (1<<28)using namespace std;int N;map <int,int> record;int ma...