LeetCode 1:《Two Sum》

class Solution:
# @return a tuple, (index1, index2)
def twoSum(self, num, target):
t = ()
for index_1, value_1 in enumerate(num):
value_2 = target - value_1
# 如果两个数相等
if value_1 == value_2:
# 出现多于一次
if num.count(value_1) > 1:
# 从第一个索引的下一个位置检索
index_2 = num.index(value_2, index_1+1)
t = (index_1+1, index_2+1)
break
else:
if value_2 in num:
index_2 = num.index(value_2, index_1+1)
t = (index_1+1, index_2+1)
break
return t