algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 15:45:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0018.四数之和.md

Browse Source
This commit is contained in:
jianghongcheng
2023-05-05 21:36:38 -05:00
committed by GitHub
parent a5bb942c95
commit dde92b1da3
1 changed files with 22 additions and 18 deletions
Download Patch File Download Diff File Expand all files Collapse all files

40
problems/0018.四数之和.md
View File

@ -209,34 +209,38 @@ class Solution {
Python：
(版本一) 双指针
```python
def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
result = []
class Solution:
def fourSum(self, nums: List[int], target: int) -> List[List[int]]:
nums.sort()
for k in range(len(nums)):
if nums[k] > target and nums[k] >= 0:
n = len(nums)
result = []
for i in range(n):
if nums[i] > target and nums[i] > 0 and target > 0:# 剪枝（可省）
break
if k > 0 and nums[k] == nums[k-1]:
if i > 0 and nums[i] == nums[i-1]:# 去重
continue
for i in range(k+1, len(nums)):
if nums[k] + nums[i] > target and nums[k] + nums[i] >= 0:
for j in range(i+1, n):
if nums[i] + nums[j] > target and target > 0: #剪枝（可省）
break
if i > k+1 and nums[i] == nums[i-1]:
if j > i+1 and nums[j] == nums[j-1]: # 去重
continue
left, right = i+1, len(nums)-1
while right > left:
if nums[k] + nums[i] + nums[left] + nums[right] > target:
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 nums[k] + nums[i] + nums[left] + nums[right] < target:
elif s < target:
left += 1
else:
result.append([nums[k], 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
right -= 1
left += 1
return result
```
(版本二) 使用字典