class Solution:
def twoSum(self,nums,target): #因为是类,所以加self
lens = len(nums)
j=-1 #j代表答案的下标
for i in range(lens):
if (target - nums[i]) in nums:
if (nums.count(target - nums[i]) == 1): #如果nums[i]是target的一半,且i前面没有答案
continue
else:
j = nums.index(target - nums[i],i+1)
break
if j>0:
return [i,j]
else:
return []