目录
今日任务:
- 454.四数相加||
- 383.赎金信
- 15.三数之和
- 18.四数之和
454.四数相加||
题目链接:454. 四数相加 II - 力扣(LeetCode)
分析:
- 定义hashmap,用key存储nums1与nums2的之和的值,value对应出现的次数
- 定义count,记录符合条件的数量
- 在循环nums3与nums4的之和的值,找寻出等于-(nums1+nums2)的key,value值,用count+value即可
字典:
class Solution:
def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: List[int]) -> int:
hashmap = dict()
for i in range(len(nums1)):
for j in range(len(nums2)):
if nums1[i] + nums2[j] in hashmap:
hashmap[nums1[i] + nums2[j]] += 1
else:
hashmap[nums1[i] + nums2[j]] = 1
count = 0
for i in range(len(nums3)):
for j in range(len(nums4)):
if -(nums3[i] + nums4[j]) in hashmap:
count += hashmap[-(nums3[i] + nums4[j])]
return count
defaultdict:
class Solution:
def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: List[int]) -> int:
from collections import defaultdict
rec, cnt = defaultdict(lambda:0), 0
for i in nums1:
for j in nums2:
rec[i + j] += 1
for i in nums3:
for j in nums4:
cnt += rec.get(-(i + j), 0)
return cnt
383.赎金信
分析:
- 分别统计ransomNote,magazine
- 检验ransomNote每个key,magazine都存在,并大于ransomNote的value
Counter:
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
from collections import Counter
counter1 = Counter(ransomNote)
counter2 = Counter(magazine)
return not counter1 - counter2
🐖:如果对于Counter不是熟悉请参考,Python collections模块之Counter()详解_python counter_chl183的博客-CSDN博客
字典:
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
dict1 = {}
for i in magazine:
dict1[i] = dict1.get(i, 0) + 1
for j in ransomNote:
if j not in dict1 or dict1[j] == 0:
return False
dict1[j] -= 1
return True
15.三数之和
分析:
- 使用双指针法left,right 达到降维的效果
- 如果nums[i] == nums[i - 1] ,continue 这一步的目的是达到去重
- nums[left] == nums[left+1] 与 nums[right] == nums[right - 1] 这些判别的目的都是为了去重,如果重复则分别的操作为left += 1 ,right -= 1
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
result = []
nums.sort()
if nums[0] > 0 or len(nums) <= 2 or nums[len(nums) - 1] < 0:
return result
for i in range(len(nums)):
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:
left += 1
elif sum_ > 0:
right -= 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.四数之和
分析:
15.三数之和 (opens new window)的双指针解法是一层for循环num[i]为确定值,然后循环内有left和right下标作为双指针,找到nums[i] + nums[left] + nums[right] == 0。
四数之和的双指针解法是两层for循环nums[k] + nums[i]为确定值,依然是循环内有left和right下标作为双指针,找出nums[k] + nums[i] + nums[left] + nums[right] == target的情况,三数之和的时间复杂度是O(n^2),四数之和的时间复杂度是O(n^3) 。
那么一样的道理,五数之和、六数之和等等都采用这种解法。
class Solution:
def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
nums.sort()
n = len(nums)
result = []
for i in range(n):
if i > 0 and nums[i] == nums[i-1]:# 去重
continue
for j in range(i+1, n):
if j > i+1 and nums[j] == nums[j-1]: # 去重
continue
left, right = j+1, n-1
while left < right:
s = nums[i] + nums[j] + nums[left] + nums[right]
if s == target:
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
elif s < target:
left += 1
else:
right -= 1
return result