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

 242. 有效的字母异位词

class Solution {
    public boolean isAnagram(String s, String t) {
        int[] record = new int[26];

        for(int i = 0;i < s.length();i ++){
            record[s.charAt(i) - 'a'] ++;
        }
        for(int i = 0;i < t.length();i ++){
            record[t.charAt(i) - 'a'] --;
        }
        for(int i = 0;i < record.length;i ++){
            if(record[i] != 0){
                return false;
            }
        }
        return true;
    }
}

 349. 两个数组的交集

class Solution {
    public int[] intersection(int[] nums1, int[] nums2) {
        Set<Integer> set1 = new HashSet<>();
        Set<Integer> set2 = new HashSet<>();
        for (int i : nums1) {
            set1.add(i);
        }
        for(int i : nums2){
            if(set1.contains(i)){
                set2.add(i);
            }
        }
        return set2.stream().mapToInt(x -> x).toArray();
    }
}

 202. 快乐数

class Solution {
    public boolean isHappy(int n) {
        Set<Integer> set = new HashSet<>();
        while(n != 1 && !set.contains(n)){
            set.add(n);
            n = getNumber(n);
        }
        return n == 1;
    }
    public int getNumber(int n){
        int sum = 0;
        while(n > 0){
            int temp = n % 10;
            sum += temp * temp;
            n = n / 10;
        }
        return sum;
    }
}

1. 两数之和

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