class Solution(object):
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
for i in range(len(nums)):
numscopy=nums[i+1:]
for j in range(len(numscopy)):
if nums[i]+numscopy[j]==target:
rlist=[]
rlist.append(i)
rlist.append(i+j+1)
return rlist
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
for i in range(len(nums)):
numscopy=nums[i+1:]
for j in range(len(numscopy)):
if nums[i]+numscopy[j]==target:
rlist=[]
rlist.append(i)
rlist.append(i+j+1)
return rlist
算法改进:
def twoSum(nums, target):
if len(nums) <= 1:
return False
buff_dict = {}
for i in range(len(nums)):
if nums[i] in buff_dict:
return [buff_dict[nums[i]], i]
else:
buff_dict[target - nums[i]] = i
nums = [11, 2, 2, 7, 11, 15]
target = 9
t=twoSum(nums, target)
print t
降低时间复杂度字典复杂度O(1)