代码随想录 Day07

---

454、四数相加II

public int fourSumCount(int[] nums1, int[] nums2, int[] nums3, int[] nums4) {
    Map<Integer, Integer> map = new HashMap<>();
    int res = 0;
    for (int i : nums1) {
        for (int j : nums2) {
            map.put(i + j, map.getOrDefault(i + j, 0) + 1);
        }
    }

    for (int i : nums3) {
        for (int j : nums4) {
            res += map.getOrDefault(-(i + j), 0);
        }
    }

    return res;
}

---

383、赎金信

public boolean canConstruct01(String ransomNote, String magazine) {
    Map<Character, Integer> map01 = new HashMap<>();
    for (char c : magazine.toCharArray()) {
        map01.put(c, map01.getOrDefault(c, 0) + 1);
    }

    Map<Character, Integer> map02 = new HashMap<>();
    for (char c : ransomNote.toCharArray()) {
        map02.put(c, map02.getOrDefault(c, 0) + 1);
    }

    for (Map.Entry<Character, Integer> entry : map02.entrySet()) {
        Character key = entry.getKey();
        Integer entryValue = entry.getValue();
        Integer value = map01.getOrDefault(key, 0);
        if (!map01.containsKey(key) || value < entryValue) {
            return false;
        }
    }
    return true;
}

public boolean canConstruct02(String ransomNote, String magazine) {
    if (ransomNote.length() > magazine.length()) {
        return false;
    }
    int[] record = new int[26];

    for (char c : magazine.toCharArray()) {
        record[c - 'a'] += 1;
    }
    for (char c : ransomNote.toCharArray()) {
        record[c - 'a'] -= 1;
    }

    for (int i : record) {
        if (i < 0) {
            return false;
        }
    }
    return true;
}

自己写的和提供的参考还是不一样，时间复杂度和空间复杂度都差了点

---

15、三数之和

public List<List<Integer>> threeSum(int[] nums) {
    List<List<Integer>> res = new ArrayList<>();
    Arrays.sort(nums);

    for (int i = 0; i < nums.length; i++) {
        if (nums[i] > 0) {
            return res;
        }
        if (i > 0 && nums[i] == nums[i - 1]) {
            continue;
        }
        int left = i + 1, right = nums.length - 1;
        while (left < right) {
            int sum = nums[i] + nums[left] + nums[right];
            if (sum == 0) {
                res.add(Arrays.asList(nums[i], nums[left], nums[right]));
                while (left < right && nums[left] == nums[left + 1]) {
                    left++;
                }
                while (left < right && nums[right] == nums[right - 1]) {
                    right--;
                }
                left++;
                right--;
            } else if (sum < 0) {
                left++;
            } else {
                right--;
            }
        }
    }

    return res;
}

---

18、四数之和

public List<List<Integer>> fourSum(int[] nums, int target) {
    List<List<Integer>> res = new ArrayList<>();
    Arrays.sort(nums);

    for (int i = 0; i < nums.length - 3; i++) {
        if (i > 0 && nums[i] == nums[i - 1]) {
            continue;
        }

        for (int j = i + 1; j < nums.length - 2; j++) {
            if (j > i + 1 && nums[j] == nums[j - 1]) {
                continue;
            }

            int left = j + 1, right = nums.length - 1;
            while (left < right) {
                long sum = (long) nums[i] + (long) nums[j] + (long) nums[left] + (long) nums[right];
                if (sum == target) {
                    res.add(Arrays.asList(nums[i], nums[j], nums[left], nums[right]));
                    while (left < right && nums[left] == nums[left + 1]) {
                        left++;
                    }
                    while (left < right && nums[right] == nums[right - 1]) {
                        right--;
                    }
                    left++;
                    right--;
                } else if (sum < target) {
                    left++;
                } else {
                    right--;
                }
            }
        }
    }

    return res;
}

不得不说，nums = [1000000000,1000000000,1000000000,1000000000] target = -294967296，这个案例是真的绝~