454.四数相加 ||
力扣题目
这道题,是四个数组,每个数组去一个值,然后让这四个值相加等于0,考虑会结果会重复。
时间复杂度O(n2) ,空间复杂度O(n2) [最坏情况,a+b都不相等]
class Solution:
def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: List[int]) -> int:
rec = dict()
count = 0 #记录 a+b+c+d = 0出现的次数
for i in nums1: #遍历A和B两个数组,key统计两个数组元素之和,value:出现的次数
for j in nums2:
rec[i+j] = rec.get(i+j,0) + 1
for i in nums3: #遍历C和D数组,如果0-(c+d)出现过,就count加上key对应的value
for j in nums4:
count += rec.get(-(i+j),0)
return count
383.赎金信
【数组,类似242.有效的字母异位词】
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
rec1 = [0] * 26
rec2= [0] * 26
for i in magazine:
rec1[ord(i) - ord('a')] +=1
for i in ransomNote:
rec2[ord(i) - ord('a')] += 1 #得到两个str的字母出现次数
return all(rec2[i] <= rec1[i] for i in range(26)) #这个很关键,就是每个位置都要大于magazine
【字典】时间复杂度O(n^2^),空间复杂度O(1)
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
rec = dict()
for i in magazine:
rec[i] = rec.get(i,0) + 1
for j in ransomNote: #遍历需要的字符
if j in rec and rec[j] >0: #如果在字典,且存在次数大于0
rec[j] -= 1
else:
return False
return True
【使用Counter】
from collections import Counter
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
return not Counter(ransomNote) -Counter(magazine)
【使用counter】
class Solution:
def canConstruct(self, ransomNote: str, magazine: str) -> bool:
return all(magazine.count(c)-ransomNote.count(c)>=0 for c in set(ransomNote))
15.三数之和
力扣题目
** 【注意】 **就是三个数在一个数组(去重很难)
1.三个数在数组只能用一次(left<right)
2.不重复,就是三元组不能相同,但是三元组里面的元素可以相同 (里面i去重,left和right也都去重了)
【双指针法】时间复杂度o(n^2^) 空间复杂度O(1)
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
result = []
nums.sort()
for i in range(len(nums)):
# 【剪枝】如果第一个元素已经大于0,不需要进一步检查
if nums[i] > 0:
return result
# !!跳过相同的元素以避免重复,注意是nums[i]等于nums[i - 1],continue
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]])
# !!跳过相同的元素以避免重复,指导指着重复元素的最后一个,比如0001,这个就让给他指着第三个0
while right > left and nums[right] == nums[right - 1]:
right -= 1
while right > left and nums[left] == nums[left + 1]:
left += 1
right -= 1
left += 1
return result
18.四数之和
力扣题目
【注意】就是三数之和+外面在套着一层循环 去重 很难!!!
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 nums[i] > target and nums[i] > 0 and target > 0:# 剪枝(可省)
break
if i > 0 and nums[i] == nums[i-1]:# 去重
continue
#这下面一坨就是三数之和
for j in range(i+1, n):
if nums[i] + nums[j] > target and target > 0: #剪枝(可省)
break
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