两数之和
class Solution(object):
def (self,nums,target):
for i in nums:
j=target-i
start_index=nums.index(i)
next_index=start_index+1
temp_nums=num[next_index:]
if j in temp_nums:
return (nums.index(i),next_index+temp_index(j)
两数之和
class Solution(object):
def (self,nums,target):
for i in nums:
j=target-i
start_index=nums.index(i)
next_index=start_index+1
temp_nums=num[next_index:]
if j in temp_nums:
return (nums.index(i),next_index+temp_index(j)