七月day7——哈希表

T1:leetcode.970 强整数

class Solution {
public:
    vector<int> powerfulIntegers(int x, int y, int bound) {
       vector<int> xs;
       vector<int> ys;
       vector<int> result;
       vector<int> ans;
       int prex = 1;
       int prey = 1;
       int hash[1000010];
       int i, j;
       memset(hash, 0, sizeof(hash));

       for (i = 0; prex <= bound; i++) {
           xs.push_back(prex);
           prex *= x;
           if (x == 1) break;
       }
       for (j = 0; prey <= bound; j++) {
           ys.push_back(prey);
           prey *= y;
           if (y == 1) break;
       }
       for (i = 0; i < xs.size(); i++) {
           for (j = 0; j < ys.size(); j++) {
               if(xs[i] + ys[j] <= bound) {
                  hash[xs[i] + ys[j]] = 1;
               }
           }
       }

       for (i = 1; i <= 1000000; ++i) {
           if (hash[i]) {
              result.push_back(i);
           }
       }
       return result;
    }
};
/*
1.push_back()是一个函数
2.先取出两边所有可能小于bound的集合存入xs和ys 不同和形参变量x和y命名相同
3.暴力遍历两层，得到所有结果后用hash数组去重
4.最后再利用hash数组的值，将去重后下标插入
*/

T2：leetcode914. 卡牌分组

class Solution {
public:
    bool hasGroupsSizeX(vector<int>& deck) {
       map<int, int> hash_map;
       for (int i = 0; i < deck.size(); i++) {
           hash_map[deck[i]]++;
       }
       int g = hash_map.begin()->second;
       for (auto i = hash_map.begin(); i != hash_map.end(); i++) {
           g = gcd(g, i->second);
       }
       return g >= 2;
    }
};
/*
1.求最大公约数 用gcd
2.hash_map 键值对 key存储了deck里的不同的元素 value存储了具体元素的个数
*/