力扣算法刷题
1.两数之和
给定一个整数数组 nums 和一个目标值 target,请你在该数组中找出和为目标值的那 两个 整数,并返回他们的数组下标。
你可以假设每种输入只会对应一个答案。但是,数组中同一个元素不能使用两遍。
给定 nums = [2, 7, 11, 15], target = 9
因为 nums[0] + nums[1] = 2 + 7 = 9
所以返回 [0, 1]
- 方法一:暴力解法 ;
class Solution:
def twoSum(self,nums,target):
for i in range(len(nums)):
for j in range(i+1,len(nums)):
if nums[i] + nums[j] == target:
return [i,j]
#测试
list_one = [2,3,5,7,9]
x = Solution()
rece_list = x.twoSum1(list_one,8)
print(rece_list)
方法二:哈希解法 ;
def twoSum1(self,nums,target):
mapping = {}
for i in range(len(nums)):
diff = target-nums[i]
if diff in mapping.keys():
return [mapping[diff],i]
else:
mapping[nums[i]] = i
list_one = [2,3,5,7,9]
x = Solution()
rece_list = x.twoSum1(list_one,8)
print(rece_list)