力扣 --哈希

第202题 快乐数

public boolean isHappy(int n) {
        HashSet<Integer> integers = new HashSet<>();
        while (n != 1 && !integers.contains(n)) {
            integers.add(n);
            int totalSum = 0;
            while (n > 0) {
                int d = n % 10;
                n = n / 10;
                totalSum += d * d;
            }
            n = totalSum;
        }
        return n == 1;
    }

第242题 有效的字母异位词

public boolean isAnagram(String s, String t) {
        HashMap<Character, Integer> sHashMap = new HashMap<>();
        HashMap<Character, Integer> tHashMap = new HashMap<>();
        for (int i = 0; i < s.length(); i++) {
            char c = s.charAt(i);
            if (sHashMap.containsKey(c)){
                sHashMap.put(c,sHashMap.get(c)+1);
            }else {
                sHashMap.put(c,1);
            }
        }
        for (int i = 0; i < t.length(); i++) {
            char c = t.charAt(i);
            if (tHashMap.containsKey(c)){
                tHashMap.put(c,tHashMap.get(c)+1);
            }else {
                tHashMap.put(c,1);
            }
        }
        for (Character character : sHashMap.keySet()) {
            if (!Objects.equals(sHashMap.get(character), tHashMap.get(character))){
                return false;
            }
        }
        if (sHashMap.size() == tHashMap.size()){
            return true;
        }
        return false;
    }

第349题 两个数组的交集

 public int[] intersection(int[] nums1, int[] nums2) {
        HashSet<Integer> numsSet1 = new HashSet<>();
        HashSet<Integer> numsSet2 = new HashSet<>();
        int index = 0;
        int[] result = new int[nums1.length];
        for (int i : nums1) {
            numsSet1.add(i);
        }
        for (int i : nums2) {
            numsSet2.add(i);
        }
        for (Integer integer : numsSet2) {
            if(numsSet1.contains(integer)){
                result[index] = integer;
                index++;
            }
        }
        return Arrays.copyOfRange(result,0,index);
    }

第383题 赎金信

public boolean canConstruct(String ransomNote, String magazine) {
        if(ransomNote == null || ransomNote.length() == 0) return true;
        //将ransomNote 和 magazine的所有字符统计次数用哈希表存储
        int rLength = ransomNote.length();
        int mLength = magazine.length();
        HashMap<Character, Integer> rMap = new HashMap<>();
        HashMap<Character, Integer> mMap = new HashMap<>();
        Character m = 0;
        for (int i = 0; i < rLength; i++) {
            m = ransomNote.charAt(i);
            if(!rMap.containsKey(m)){
                rMap.put(m,0);
            }
            rMap.put(m,rMap.get(m)+1);
        }

        for (int i = 0; i < mLength; i++) {
            m = magazine.charAt(i);
            if(!mMap.containsKey(m)){
                mMap.put(m,0);
            }
            mMap.put(m,mMap.get(m)+1);
        }

        for (Character character : rMap.keySet()) {
            if(!mMap.containsKey(character) || mMap.get(character) < rMap.get(character)){
                return false;
            }
        }
        return true;
    }

第454题 四数相加 ||

思路：将四个数组两两相加，转变为一个两数相加的问题。

public int fourSumCount(int[] nums1, int[] nums2, int[] nums3, int[] nums4) {
        int n = nums1.length;
        if(n == 0) return 0;

        HashMap<Integer, Integer> h1 = new HashMap<>();
        HashMap<Integer, Integer> h2 = new HashMap<>();
        int m = 0;
        int count = 0;
        //计算nums1 和 nums2 任意两个值相加的结果以及该结果出现的次数
        //计算nums3 和 nums4 任意两个值相加的结果以及该结果出现的次数
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < n; j++) {
                m = nums1[i]+nums2[j];
                if(!h1.containsKey(m)){
                    h1.put(m,0);
                }
                h1.put(m,h1.get(m)+1);

                m = nums3[i]+nums4[j];
                if(!h2.containsKey(m)){
                    h2.put(m,0);
                }
                h2.put(m,h2.get(m)+1);
            }
        }
        for (Integer integer : h1.keySet()) {
            if(h2.containsKey(-integer)){
                count = count + h1.get(integer) * h2.get(-integer);
            }
        }
        return count;
    }