代码随想录打卡-哈希表-CSDN博客

本文链接：https://blog.csdn.net/qq_57446667/article/details/134473197

class Solution:
    def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: List[int]) -> int:
        # 映射等同于python中的字典，也存在key、value
        # 字典初始化：{}、dict()
        # 判断一个元素是否在map或者字典中，使用“if 待查元素 in map/字典：”语句
        count = 0
        maps = dict()
        for i in range(len(nums1)):
            for j in range(len(nums2)):
                q = nums1[i] + nums2[j]
                # if q in maps.keys:
                maps[q] = maps.get(q, 0) + 1
        for i in range(len(nums3)):
            for j in range(len(nums4)):
                res = 0- (nums3[i] + nums4[j])
                if res in maps:
                    count += 1
                # for e in maps.keys():
                #     if res == e:
                #         count += maps[res]
        return count

383. 赎金信

class Solution:
    def canConstruct(self, ransomNote: str, magazine: str) -> bool:
        # 确实简单，本题主要考察对字典的使用熟练程度：包括字典初始化、字典调用键和值、查看字典中
        # 字典中是否包含要查物体
        maps_a = dict()
        maps_b = dict()
        for i in ransomNote:
            maps_a[i] = maps_a.get(i, 0) + 1
        for i in magazine:
            maps_b[i] = maps_b.get(i, 0) + 1
        for key, value in maps_a.items():
            if key in maps_b and value <= maps_b[key]:
                return True
            else:
                return False

15. 三数之和

class Solution:
    def threeSum(self, nums: List[int]) -> List[List[int]]:
        # 解法一：这里使用的是暴力解法，三层for循环，最后对数组排序
        # 使用集合对数组进行降重
        # lists = set()
        # for i in range(len(nums)-2):
        #     for j in range(i+1, len(nums)-1):
        #         for q in range(j+1, len(nums)):
        #             if nums[i] + nums[j] + nums[q] == 0:
        #                 w = [nums[i], nums[j], nums[q]]
        # 列表排序list.sort()，对列表进行升序排序，但是返回None
        #                 w.sort()
        # 集合添加元素，使用.add()，小括号里面是元组，不能是列表，否则会报错
        #                 lists.add(tuple(w))
        #                 # lists.add(100)
        # return list(lists)


        # 解法二：使用双指针法
        nums.sort()
        result = []

        # for i in range(len(nums) - 1):
        for i in range(len(nums)):
            left = i + 1
            right = len(nums) - 1
            if nums[i] > 0:
                return result
            # 更新i值，去除重复的值
            if i > 0 and nums[i - 1] == nums[i]:
                    continue
            while left < right:
                if nums[i] + nums[left] + nums[right] > 0:
                    right -= 1
                elif nums[i] + nums[left] + nums[right] < 0:
                    left += 1
                elif nums[i] + nums[left] + nums[right] == 0:
                    result.append([nums[i], nums[left], nums[right]])
                    # while nums[right] == nums[right - 1]:
                    #     continue
                    # while nums[left] == nums[left + 1]:
                    #     continue
                    # 更新左右的值，去除重复的值
                    while right > left and nums[left] == nums[left + 1]:
                        left += 1
                    while right > left 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 k in range(len(nums)):
        #     if nums[k] > target and nums[k] > 0 and target > 0:
        #         break
        #     if k > 0 and nums[k] == nums[k-1]:
        #         continue
        #     for i in range(k + 1, len(nums)):
        #         if nums[k] + nums[i] > 0 and nums[k] + nums[i] > target and target > 0:
        #             continue
        #         if i > k+1 and nums[i] == nums[i-1]:
        #             i += 1
        #         left = i + 1
        #         right = len(nums) - 1
        #         while left < right:
        #             if nums[k] + nums[i] + nums[left] + nums[right] < target:
        #                 left += 1
        #             elif nums[k] + nums[i] + nums[left] + nums[right] > target:
        #                 right -= 1
        #             else:
        #                 nums[k] + nums[i] + nums[left] + nums[right] == target
        #                 result.append([nums[k], nums[i], 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

        # 方法二暴力解法，使用四层for循环，同时使用python集合对列表进行去重
        result = set()
        for i in range(len(nums)-3):
            for j in range(i+1, len(nums)-2):
                for q in range(j + 1, len(nums) - 1):
                    for w in range(q + 1, len(nums)):
                        if nums[i] + nums[j] + nums[q] + nums[w] == target:
                            qw = [nums[i], nums[j], nums[q], nums[w]]
                            qw.sort()
                            result.add(tuple(qw))
        return list(result)