代码随想录训练营第III期--007--python

# 代码随想录训练营第III期--007--python
import collections
# ●  454.四数相加II 
def fourSumCount(nums1, nums2, nums3, nums4):
    tmp1 = collections.defaultdict(int)
    for i in nums1:
        for j in nums2:
            tmp1[i+j] += 1

    count = 0
    for i in nums3:
        for j in nums4:
            if -(i+j) in tmp1.keys():
                count += tmp1[-i-j]
    return count 
nums1 = [1,2]
nums2 = [-2,-1]
nums3 = [-1,2]
nums4 = [0,2]
print(fourSumCount(nums1, nums2, nums3, nums4))
# 反思，最开始使用的是list来安放i+j，在第二次查找-i-j时会重复查找，导致count结果错误

# ●  383. 赎金信 
def canConstruct(s1, s2):
    def build_dict(s):
        res = collections.defaultdict(int)
        for i in s:
            res[i] += 1
        return res 
    
    ss1 = build_dict(s1)
    ss2 = build_dict(s2)

    for i in ss1.keys():
        if i not in ss2.keys():
            return False 
        else:
            if ss1[i] > ss2[i]:
                return False 
    return True 
s1 = 'aa'
s2 = 'ab'
print(canConstruct(s1,s2))

# ●  15. 三数之和 
# 还是用的双指针方式实现的，哈希的做法不会
def threeSum(nums: List[int]) -> List[List[int]]:
    if len(nums) < 3: return []
    if len(nums) == 3 and sum(nums) != 0: return [] 

    nums.sort()
    res = []
    for i in range(len(nums)):
        left = i+1
        right = len(nums) - 1
        while left < right:
            ss = nums[i] + nums[left] + nums[right]
            if ss < 0:
                left += 1
            elif ss > 0:
                right -= 1
            else:
                if [nums[i],nums[left],nums[right]] not in res:
                    res.append([nums[i],nums[left],nums[right]])
                left += 1
                right -= 1

    return res
# ●  18. 四数之和 
# 套用的上面的模板，稍微做了一点点调整，就是i和j的上界以及下界
def fourSum(nums, target):
    if len(nums) < 4: return []
    if len(nums) == 4 and sum(nums) != target: return []
    if len(nums) == 4 and sum(nums) == target: return [nums]

    nums.sort()
    res = []
    # print(nums) 这里的两个print超时了
    for i in range(len(nums)-3):# 因为是4个数，i的上界是len-3
        for j in range(len(nums)-1, i+2, -1):# 同理，j的下界是i+2
            left = i + 1
            right = j - 1
            while left < right:
                ss = nums[i] + nums[left] + nums[right] + nums[j]
                tmp = [nums[i], nums[left], nums[right], nums[j]]
                # print(tmp) 这里的两个print超时了
                if ss < target:
                    left += 1
                elif ss > target:
                    right -= 1
                else:
                    if tmp not in res:
                        res.append(tmp)
                    left += 1
                    right -= 1

    return res