代码随想录算法训练营第七天| 454.四数相加II 、383. 赎金信、15. 三数之和 、18. 四数之和

454.四数相加II

题目链接：454.四数相加II
参考文章链接：代码随想录_454.四数相加II

class Solution {
    public int fourSumCount(int[] nums1, int[] nums2, int[] nums3, int[] nums4) {
        Map<Integer, Integer> map = new HashMap<>();
        int temp;
        int res = 0;
        for (int i : nums1) {
            for (int j : nums2) {
                temp = i + j;
                if (map.containsKey(temp)) {
                    map.put(temp, map.get(temp) + 1);
                } else {
                    map.put(temp, 1);
                }
            }
        }
        for (int i : nums3) {
            for (int j : nums4) {
                temp = i + j;
                if (map.containsKey(0 - temp)) {
                    res += map.get(0 - temp);
                }
            }
        }

        return res;
    }
}

383. 赎金信

题目链接：383. 赎金信

代码如下：

class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        int[] arr = new int[26];
        for (int i = 0; i < magazine.length(); i++) arr[magazine.charAt(i) - 'a']++;
        for (int i = 0; i < ransomNote.length(); i++) arr[ransomNote.charAt(i) - 'a']--;
        for (int count : arr) {
            if (count < 0) return false;
        }
        return true;
    }
}

15. 三数之和

题目链接：15. 三数之和

class Solution {
    public List<List<Integer>> threeSum(int[] nums) {
        List<List<Integer>> result = new ArrayList<>();
        Arrays.sort(nums);
        
        for (int i = 0; i < nums.length; i++) {
            if (nums[i] > 0) return result;

            if (i > 0 && nums[i] == nums[i - 1]) continue;

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

                    left++;
                    right--;
                }
            }
        }
        return result;
    }
}

18. 四数之和

题目链接：18. 四数之和

class Solution {
    public List<List<Integer>> fourSum(int[] nums, int target) {
        List<List<Integer>> result = new ArrayList<>();
        Arrays.sort(nums);
        int len = nums.length;
        for (int i = 0; i < len; i++) {
            //剪枝操作，防止负数进行误操作
            if (nums[i] > target && nums[i] > 0) return result;
            //去重操作
            if (i > 0 && nums[i] == nums[i - 1]) continue;

            for (int j = i + 1; j < len; j++) {
                //去重操作
                if (j > i + 1 && nums[j] == nums[j - 1]) continue;

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