class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
lens=len(nums)
j=-1
for i in range(1,lens):
temp=nums[:i]
if (target-nums[i]) in temp:
j=temp.index(target-nums[i])
break
if j >= 0:
return [j,i]
else:
return []
解法二
class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
lens=len(nums)
j=-1
for i in range(lens):
if(target-nums[i]) in nums:
if(target-nums[i]==nums[i]) and nums.count(target-nums[i])==1:
continue
else:
j=nums.index(target-nums[i],i+1)
break
if j>0:
return[i,j]
else:
return []