题目:
给定一个整数数组和一个目标值,找出数组中和为目标值的两个数。
你可以假设每个输入只对应一种答案,且同样的元素不能被重复利用。
- 暴力算法, O(n2)
暴力算法是将全部的list遍历两边,直到找到target。
class Solution:
def twoSum(self, nums, target):
length = len(nums)
for i in range(length):
for j in range(i+1,length):
sum = nums[i]+nums[j]
if sum == target:
return [i,j]
- 用哈希的方式来寻找
这个方法是O(n), 存入字典 = n, 在寻找的时候是n*len(dict[key]), 因此是mn+n, 所以位O(n)
class Solution:
def twoSum(self, nums, target):
dict = {}
length = len(nums)
for i in range(length):
current_number = nums[i]
if str(current_number)[0] not in dict.keys():
dict[str(current_number)[0]] = [(current_number,i)]
else:
dict[str(current_number)[0]].append((current_number,i))
for i in range(length):
remain = target - nums[i]
key_number = str(remain)[0]
if key_number in dict.keys():
for j in dict[key_number]:
if j[0] == remain and j[1] != i:
return [i, j[1]]