Day07 | 454.四数相加II, 383. 赎金信,15. 三数之和, 18. 四数之和

454.四数相加II

链接：LeetCode 454

class Solution {
    public int fourSumCount(int[] nums1, int[] nums2, int[] nums3, int[] nums4) {
            int len  = nums1.length;
            HashMap<Integer, Integer> map = new HashMap<>(16);
            for(int i = 0; i<len; i++) {
                for(int j = 0; j<len; j++) {
                    int n = nums1[i] + nums2[j];
                    map.put(n, map.getOrDefault(n, 0) + 1);
                }
            }
            int cnt = 0;
            for(int i = 0; i<len; i++) {
                for(int j = 0; j<len; j++) {
                    int n = nums3[i] + nums4[j];
                    if (map.get(-n) != null) {
                        cnt += map.get(-n);
                    }
                }
            }
            return cnt;
    }
}

383. 赎金信

链接：LeetCode 24

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 i = 0; i<26; i++) {
            if (arr[i] < 0) {
                return false;
            }
        }
        return true;
    }
}

15. 三数之和

链接：LeetCode 24

class Solution {
    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) {
                break;
            }

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

            int right = nums.length - 1;
            int left = i + 1;
            while(right > left) {
                int n = nums[i] + nums[right] + nums[left];
                if (n > 0) {
                    right--;
                } else if(n < 0) {
                    left++;
                } else {
                    res.add(List.of(nums[i], nums[right], nums[left]));
                    while(right > left && nums[right] == nums[right - 1]) {
                        right--;
                    }

                    while(right > left && nums[left] == nums[left + 1]) {
                        left++;
                    }
                    right--;
                    left++;
                }

            }

        }
         return res;
    }
}

18. 四数之和

链接：LeetCode 18

class Solution {
    public List<List<Integer>> fourSum(int[] nums, int target) {
        List<List<Integer>> res = new ArrayList<>();
        Arrays.sort(nums);
        for(int j=0; j< nums.length; j++) {
        if (j > 0 && nums[j] == nums[j-1]) {
                continue;
            }
        for(int i=j+1; i< nums.length; i++) {
            // if (nums[i] > 0) {
            //     break;
            // }

            if (i >j + 1 && nums[i] == nums[i-1]) {
                continue;
            }

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

                    while(right > left && nums[left] == nums[left + 1]) {
                        left++;
                    }
                    right--;
                    left++;
                }

            }

        }
        }
         return res;
    }
}