代码随想录算法训练营第七天 | Leetcode454 四数相加II、Leetcode383 赎金信、Leetcode15 三数之和、Leetcode18 四数之和

454.四数相加II

class Solution:
    def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: List[int]) -> int:
        record=dict()
        n=0
        for n1 in nums1:   #为什么ij形式用到这里会报错？
            for n2 in nums2:
                record[n1+n2]=record.get(n1+n2,0)+1
        for n3 in nums3:
            for n4 in nums4:
                target= -n3-n4
                if target in record:
                    n+=record[target]
        return n

383. 赎金信

class Solution:
    def canConstruct(self, ransomNote: str, magazine: str) -> bool:
        ransom=[0]*26
        maga=[0]*26
        for i in ransomNote: #每个字符循环
            ransom[ord(i)-ord('a')]+=1
        for i in magazine:
            maga[ord(i)-ord('a')]+=1
        for i in range(26):
            if ransom[i]>maga[i]:
                return False
        return True

15. 三数之和

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

18. 四数之和

class Solution:
    def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
        nums.sort()   
        result=[]
        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]>target and target>0:
                    break
                if i>k+1 and nums[i]==nums[i-1]:
                    continue
                left=i+1
                right=len(nums)-1
                while left<right:
                    sum=nums[k]+nums[i]+nums[left]+nums[right]
                    if sum>target:
                        right-=1
                    elif sum<target:
                        left+=1
                    else:
                        result.append([nums[k],nums[i],nums[left],nums[right]])
                        while left<right and nums[right]==nums[right-1]: #额外if的话超时
                            right-=1
                        while left<right and nums[left]==nums[left+1]:
                            left+=1
                        left+=1
                        right-=1
        return result