题目:
Given an array nums of n integers and an integer target, are there elements a, b, c, and d in nums such that a + b + c + d = target? Find all unique quadruplets in the array which gives the sum of target.
Note:
The solution set must not contain duplicate quadruplets.
Example:
Given array nums = [1, 0, -1, 0, -2, 2], and target = 0.
A solution set is:
[
[-1, 0, 0, 1],
[-2, -1, 1, 2],
[-2, 0, 0, 2]
]
题意: 给出一个数组和一个target,在该数组中找到四个数使之和为target。
思路: 跟之前的3sum套路一样,只是外层多一层循环,因此时间复杂度为
O
(
n
3
)
O(n^3)
O(n3).
代码仅供参考:
class Solution(object):
def fourSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[List[int]]
"""
nums = sorted(nums)
solutions = []
for i in range(len(nums)-3):
if i != 0 and nums[i] == nums[i-1]:
continue
t = target - nums[i]
temp_nums = nums[i+1:]
for j in range(len(temp_nums)-2):
if j!=0 and temp_nums[j] == temp_nums[j-1]:
continue
k = j+1
l = len(temp_nums) -1
while k < l:
if temp_nums[j] + temp_nums[k] + temp_nums[l] == t:
solutions.append([nums[i], temp_nums[j], temp_nums[k], temp_nums[l]])
k += 1
l -= 1
while k < l and temp_nums[k] == temp_nums[k - 1]:
k += 1
while k < l and temp_nums[l] == temp_nums[l + 1]:
l -= 1
elif temp_nums[j] + temp_nums[k] + temp_nums[l] < t:
k += 1
else:
l -= 1
return solutions