Day6:哈希表(2)

四数相加（力扣454）

class Solution {
    public int fourSumCount(int[] nums1, int[] nums2, int[] nums3, int[] nums4) {
        int n = nums1.length;
        int aus = 0;
        Map<Integer, Integer> mp = new HashMap();
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                int temp = nums1[i] + nums2[j];
                mp.put(temp, mp.getOrDefault(temp, 0)+1);
            }
        }
        for(int i = 0; i < n; i++){
            for(int j = 0; j < n; j++){
                int temp = 0 - (nums3[i] + nums4[j]);
                if(mp.containsKey(temp)){
                    aus += mp.get(temp);
                }
            }
        }
        return aus;
    }
}

赎金信（力扣383）

class Solution {
    public boolean canConstruct(String ransomNote, String magazine) {
        char[] rans = ransomNote.toCharArray();
        char[] maga = magazine.toCharArray();
        int[] charnum = new int[26];
        for(char c: maga){
            charnum[c - 'a']++;
        }
        for(char c: rans){
            charnum[c - 'a']--;
        }
        for(int i: charnum){
            if(i < 0) return false;
        }
        return true;
    }
}

三数之和（力扣15）

class Solution {
    public List<List<Integer>> threeSum(int[] nums) {
        List<List<Integer>> aus = new ArrayList();
        Arrays.sort(nums);
        for(int i = 0; i < nums.length; i++){
            if (nums[i] > 0) { 
                return aus;
            }
            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{
                    aus.add(Arrays.asList(nums[i],nums[left],nums[right]));
                    while(right > left && nums[right]==nums[right-1]) right--;
                    while(right > left && nums[left]==nums[left + 1]) left++;
                    left++;
                    right--;
                }
            }
        }
        return aus;
    }
}

四数之和（力扣18）

和上面一题一样的方法：双指针，所以我懒狗一下；

class Solution {
    public List<List<Integer>> fourSum(int[] nums, int target) {
        List<List<Integer>> result = new ArrayList<>();
        Arrays.sort(nums);
       
        for (int i = 0; i < nums.length; i++) {
		
            // nums[i] > target 直接返回, 剪枝操作
            if (nums[i] > 0 && nums[i] > target) {
                return result;
            }
		
            if (i > 0 && nums[i - 1] == nums[i]) {    // 对nums[i]去重
                continue;
            }
            
            for (int j = i + 1; j < nums.length; j++) {

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

                int left = j + 1;
                int right = nums.length - 1;
                while (right > left) {
		    // nums[k] + nums[i] + nums[left] + nums[right] > target int会溢出
                    long sum = (long) 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]));
                        // 对nums[left]和nums[right]去重
                        while (right > left && nums[right] == nums[right - 1]) right--;
                        while (right > left && nums[left] == nums[left + 1]) left++;

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

每日一题（力扣2418）

今天的每日一题也可以用哈希表解决

class Solution {
    public String[] sortPeople(String[] names, int[] heights) {
        Map<Integer, String> mp = new HashMap();
        int n = names.length;
        for(int i = 0; i < n; i++){
            mp.put(heights[i], names[i]);
        }
        Arrays.sort(heights);
        int j = 0;
        for(int i = n-1; i >= 0; i--){
            names[j] = mp.get(heights[i]);
            j++;
        }
        return names;
    }
}