代码随想录算法训练营第六天 | 242.有效的字母异位词 349. 两个数组的交集 202. 快乐数 1. 两数之和

242.有效的字母异位词

原题链接: 242.有效的字母异位词

class Solution {
    public boolean isAnagram(String s, String t) {
        Map<Character, Integer> num1 = new HashMap<>();
        Map<Character, Integer> num2 = new HashMap<>();
        for (int i = 0; i < 26; i++) {
            num1.put((char) ('a' + i), 0);
        }
        for (int i = 0; i < 26; i++) {
            num2.put((char) ('a' + i), 0);
        }
        if (s.length() != t.length()) {
            return false;
        }
        for (int i = 0; i < s.length(); i++) {
            num1.put(s.charAt(i), num1.get(s.charAt(i)) + 1);
        }
        for (int i = 0; i < t.length(); i++) {
            num2.put(t.charAt(i), num2.get(t.charAt(i)) + 1);
        }
        for (int i = 0; i < 26; i++) {
            if (!num1.get((char) ('a' + i)).equals(num2.get((char) ('a' + i)))) {
                return false;
            }
        }
        return true;
    }
}

349. 两个数组的交集

原题链接: 349. 两个数组的交集

class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        Map<Integer, Integer> data = new HashMap<>();
        List<Integer> result = new ArrayList<>();
        for (int i = 0; i < nums1.length; i++) {
            data.put(nums1[i], 0);
        }
        for (int i = 0; i < nums2.length; i++) {
            if (data.keySet().contains(nums2[i]) && !result.contains(nums2[i])) {
                result.add(nums2[i]);
            }
        }
        int[] nresult = new int[result.size()];
        for (int i = 0; i < result.size(); i++) {
            nresult[i] = result.get(i);
        }
        return nresult;
    }
}

202. 快乐数

原题链接: 202. 快乐数

class Solution {
    public boolean isHappy(int n) {
        Set<Integer> set = new HashSet<>();
        while (n != 1) {
            n = calHappy(n);
            if (!set.contains(n)) {
                set.add(n);
            } else {
                return false;
            }
        }
        return true;
    }

    public int calHappy(int n) {
        int result = 0;
        while (n != 0) {
            result += (n % 10) * (n % 10);
            n /= 10;
        }
        return result;
    }
}

1. 两数之和

原题链接: 1. 两数之和

class Solution {
    public int[] twoSum(int[] nums, int target) {
        List<Integer> list1 = new ArrayList<>();
        List<Integer> list2 = new ArrayList<>();
        for (int i = 0; i < nums.length; i++) {
            list1.add(nums[i]);
            list2.add(target - nums[i]);
        }
        int result[] = new int[2];
        for (int i = 0; i < nums.length; i++) {
            if (list2.contains(list1.get(i)) && list2.indexOf(list1.get(i)) != i) {
                result[0] = i;
                result[1] = list2.indexOf(list1.get(i));
                return result;
            }
        }
        return result;
    }
}

最近有些忙所以代码写的有些丑了，后面有时间再改成最优解