//这里填你的代码^^
//注意代码要放在两组三个点之间,才可以正确显示代码高亮哦~
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
if not nums:return []
n,res=len(nums),[]
nums.sort()
if nums[0]>target:return []
i,j=0,1
for i in range(n-1):
for j in range(i+1,n):
if num[i]<target:
target-=nums[i]
if num[j]>target:return
elif nums[j]<target:j+=1
else:
res.append([i,j])
return
return res