NC54 数组中相加和为0的三元组
题目描述 给出一个有n个元素的数组S,S中是否有元素a,b,c满足a+b+c=0?找出数组S中所有满足条件的三元组。
注意: 三元组(a、b、c)中的元素必须按非降序排列。(即a≤b≤c) 解集中不能包含重复的三元组。
例如,给定的数组 S = {-10 0 10 20 -10 -40},解集为(-10, 0, 10) (-10, -10, 20)
示例1
输入
[-2,0,1,1,2]
返回值
[[-2,0,2],[-2,1,1]]
#
#
# @param num int整型一维数组
# @return int整型二维数组
#暴力破解超时
import itertools
class Solution:
def threeSum(self , num ):
# write code here
s=[]
for i in itertools.permutations(num,3):
if sum(i)==0 and sorted(i) not in s:
s.append(sorted(i))
#arr=[list(i) for i in s]
return s
sol=Solution()
sol.threeSum([-2,0,1,1,2])
#
#
# @param num int整型一维数组
# @return int整型二维数组
#
class Solution:
def threeSum(self , num ):
# write code here
# if not num:
# return []
num.sort()
res = []
m = len(num)
for i in range(m-2):
if num[i]>0:
break
if i>0 and num[i]==num[i-1]:
continue
target = -num[i]
lo, hi= i+1, m-1
while lo<hi:
sum = num[lo]+num[hi]
if sum==target:
res.append([num[i], num[lo], num[hi]])
while lo<hi and num[lo]==num[lo+1]:
lo +=1
while lo<hi and num[hi]==num[hi-1]:
hi -=1
hi -=1
lo +=1
elif sum>target:
hi -=1
else:
lo +=1
return res
sol=Solution()
sol.threeSum([-2,0,1,2])