LeetCode刷题（python3）|day07 第三章哈希表part02

qq_41813878

已于 2024-02-21 10:29:41 修改

阅读量377

点赞数 8

文章标签： leetcode 散列表算法 python

于 2024-02-21 10:28:53 首次发布

本文链接：https://blog.csdn.net/qq_41813878/article/details/136205034

版权

454.四数相加II

class Solution:
    def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: List[int]) -> int:
        count = 0
        mydict1 = dict()
        for i, num1 in enumerate(nums1):
            for j, num2 in enumerate(nums2):
                if (num1 + num2) in mydict1:
                    mydict1[num1 + num2] += 1
                else:
                    mydict1[num1 + num2] = 1

        mydict2 = dict()
        for i, num3 in enumerate(nums3):
            for j, num4 in enumerate(nums4):
                if (num3 + num4) in mydict2:
                    mydict2[num3 + num4] += 1
                else:
                    mydict2[num3 + num4] = 1

        for key1, value1 in mydict1.items():
            if -key1 in mydict2:
                #这里的*要想清楚
                count += (value1 * mydict2[-key1])

        return count

383. 赎金信

class Solution:
    def canConstruct(self, ransomNote: str, magazine: str) -> bool:
        hashmap = defaultdict(int)
        for c in magazine:
            hashmap[c] += 1
        for c in ransomNote:
            hashmap[c] -= 1
            if hashmap[c] < 0:
                return False
        
        return True

15. 三数之和

class Solution:
    def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
        result = []
        nums.sort()
        for i in range(len(nums)):
            if i > 0 and nums[i] == nums[i-1]:
                continue
            for j in range(i+1, len(nums)):
                if j > i+1 and nums[j] == nums[j-1]:
                    continue
                left = j+1
                right = len(nums)-1
                while left < right:
                    if (nums[i] + nums[j] + nums[left] + nums[right] < target):
                        left += 1
                    elif nums[i] + nums[j] + nums[left] + nums[right] > target:
                        right -= 1
                    else:
                        result.append([nums[i], nums[j], nums[left], nums[right]])
                        while left < right and nums[left] == nums[left+1]:
                            left += 1
                        while left < right and nums[right] == nums[right-1]:
                            right -= 1
                        left += 1
                        right -= 1
        
        return result

18. 四数之和

class Solution:
    def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
        result = []
        nums.sort()
        for i in range(len(nums)):
            if i > 0 and nums[i] == nums[i-1]:
                continue
            for j in range(i+1, len(nums)):
                if j > i+1 and nums[j] == nums[j-1]:
                    continue
                left = j+1
                right = len(nums)-1
                while left < right:
                    if (nums[i] + nums[j] + nums[left] + nums[right] < target):
                        left += 1
                    elif nums[i] + nums[j] + nums[left] + nums[right] > target:
                        right -= 1
                    else:
                        result.append([nums[i], nums[j], nums[left], nums[right]])
                        while left < right and nums[left] == nums[left+1]:
                            left += 1
                        while left < right and nums[right] == nums[right-1]:
                            right -= 1
                        left += 1
                        right -= 1
        
        return result