前言
坚持刷题,从己做起。
一、四数之和
class Solution:
def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
nums.sort()
n = len(nums)
res = []
for i in range(n):
if i > 0 and nums[i] == nums[i-1]:
continue
for k in range(i+1, n):
if k > i+1 and nums[k] == nums[k-1]:
continue
p = k+1
q = n-1
while p < q:
if nums[i] + nums[k] + nums[p] + nums[q] > target:
q -= 1
elif nums[i] + nums[k] + nums[p] + nums[q] > target:
p += 1
else:
res.append([nums[i], nums[k], nums[p], nums[q]])
while p < q and nums[p] == nums[p + 1]:
p += 1
while p < q and nums[q] == nums[q - 1]:
q -= 1
p = p + 1
q = q - 1
return res
二、三数之和
代码如下(示例):
class Solution:
def threeSum(self, nums: List[int]) -> List[List[int]]:
nums.sort()
n = len(nums)
ans = []
for i in range(n):
if i > 0 and nums[i] == nums[i-1]:
continue
while left < right:
total = nums[i] + nums[left] + nums[right]
if total > 0:
right -= 1
elif total < 0:
left += 1
else:
ans.append([nums[i], 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
return ans
三、赎金信
代码如下(示例):
class Solusion:
def canconstryct(self, ransomNote: str, magazine: str) -> bool:
arr = [0] * 26
for x in magazine:
ord[x] - ord['a'] -= 1
for x in ransomNote:
if ord[x] - ord['a'] == 0
return False
else:
ord[x] - ord['a'] -= 1
return True
四、四数相加II
class Solution:
def fourSumCount(self, nums1: List[int], nums2: List[int], nums3: List[int], nums4: List[int]) -> int:
hashmap = dict()
for n1 in nums1:
for n2 in nums2:
if n1 + n2 in hashmap:
hashmap[n1 + n2] += 1
else:
hashmap[n1 + n2] = 1
count = 0
for n3 in nums3:
for n4 in nums4:
key = - n3 - n4
if key in hashmap:
count += hashmap[key]
return count
总结
继续保持,加油。