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

思路

按照两数之和的思路，将前两个表的和遍历存入一个哈希表

再遍历后两个表之和

代码

class Solution:
    def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: List[int]) -> int:
        hash=dict()
        for n1 in nums1:
            for n2 in nums2: 
                hash[n1+n2]=hash.get(n1+n2,0)+1

        count=0
        for n3 in nums3:
            for n4 in nums4:
                key=-n3-n4 
                count+=hash.get(key,0)

        return count

思路
和两数之和思路相同，存储每个字母出现的次数，分别遍历，出现次数都大于0时return True

代码

class Solution:
    def canConstruct(self, ransomNote: str, magazine: str) -> bool:
        hash={}
        for i in ransomNote:
            hash[i]=hash.get(i,0)-1
        for j in magazine:
            hash[j]=hash.get(j,0)+1

        print(hash)
        for i in hash:
            if hash[i]<0:
                return False 
        return True

思路

排序+双指针，固定第一个元素，将第一个元素后的所有元素作为窗口，不断移动左右指针。

代码

class Solution:
    def threeSum(self, nums: List[int]) -> List[List[int]]:
        res=set()
        nums.sort()
        k=0
        while k <=len(nums)-3:
            if nums[k]>0:
                break
            if k>=1 and nums[k]==nums[k-1]:
                k+=1
                continue
            i=k+1
            j=len(nums)-1
            while i<j:
                if nums[k]+nums[i]+nums[j]<0:
                    i+=1
                elif nums[k]+nums[i]+nums[j]>0:
                    j-=1
                elif nums[k]+nums[i]+nums[j]==0:
                    res.add((nums[k],nums[i],nums[j]))
                    i+=1
            k+=1
        return list(res)

思路

三数之和多加一层循环

代码

class Solution:
    def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
        nums.sort()
        res=[]
        n=len(nums)

        
        a=0
        while a<=n-4:
            if nums[a]+nums[a+1]+nums[a+2]+nums[a+3]>target:
                break
            if nums[a]+nums[n-1]+nums[n-2]+nums[n-3]<target:
                a+=1
                continue
            if a>=1 and nums[a]==nums[a-1]:
                a+=1
                continue
            b=a+1
            
            while b<=n-3:
                if b>a+1 and nums[b]==nums[b-1]:
                    b+=1
                    continue
                if nums[a]+nums[b]+nums[b+1]+nums[b+2]>target:
                    break 
                if nums[a]+nums[b]+nums[n-1]+nums[n-2]<target:
                    b+=1
                    continue

                c=b+1
                d=n-1 
                
                while c<d:
                    if nums[a]+nums[b]+nums[c]+nums[d]<target:
                        c+=1
                        
                    elif nums[a]+nums[b]+nums[c]+nums[d]>target:
                        d-=1 
                        
                    elif nums[a]+nums[b]+nums[c]+nums[d]==target:
                        res.append((nums[a],nums[b],nums[c],nums[d]))
                        
                        c+=1
                b+=1
            a+=1
        return list(set(res))