代码随想录day6 java版 哈希表

力扣242 有效字母的异位数

class Solution {
    public boolean isAnagram(String s, String t) {
        int[] set = new int[26];
        for (int i = 0; i < s.length(); i ++) {
            set[s.charAt(i) - 'a'] ++;
        }
        for (int i = 0; i < t.length(); i ++) {
            set[t.charAt(i) - 'a'] --;
        }
        for (int i = 0; i < 26; i ++) {
            if (set[i] != 0)return false;
        }
        return true;
    }
}

力扣349 两个数组的交集

class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        int[] a = new int[1001];
        Set<Integer> set = new HashSet<>();
        for(int i = 0; i < nums1.length; i ++) {
            a[nums1[i]] ++;
        }
        for(int i = 0; i < nums2.length; i ++) {
            if(a[nums2[i]] != 0) set.add(nums2[i]);
        }
        return set.stream().mapToInt(Integer::intValue).toArray();
    }
}

力扣202 快乐数

class Solution {
    public boolean isHappy(int n) {
        int sum = getSum(n);
        Set<Integer> s = new HashSet<>();
        while (sum != 1) {
            if (s.contains(sum))return false;
            else {
                s.add(sum);
                sum = getSum(sum);
            }
        }
        return true;
    }
    public int getSum(int n) {
        int sum = 0;
        while (n != 0) {
            sum += (n % 10) * (n % 10);
            n = n / 10;
        }
        return sum;
    }
}

力扣1 两数之和

哈希表做法

class Solution {
    public int[] twoSum(int[] nums, int target) {
        Map<Integer, Integer> m = new HashMap<>();
        for (int i = 0; i < nums.length; i ++) {
            if (m.containsKey(nums[i])) return new int[]{m.get(nums[i]), i};
            else m.put(target - nums[i], i);
        }
        return new int[]{-1,-1};
    }
}