leetcode two sum python_LeetCode in Python

解法1、切片后查找class Solution:

def twoSum(self, nums: List[int], target: int) -> List[int]:

for i in nums:

j = target - i

start_index = nums.index(i)

next_index = start_index + 1

temp_nums = nums[next_index:]

if j in temp_nums:

return [nums.index(i), next_index + temp_nums.index(j)]

注意返回值index的转换

解法2、hash字典class Solution:

def twoSum(self, nums: List[int], target: int) -> List[int]:

dict = {}

for i in range(len(nums)):

if target - nums[i] not in dict:

dict[nums[i]] = i

else:

return [dict[target-nums[i]], i]

解法3、同2class Solution:

def twoSum(self, nums: List[int], target: int) -> List[int]:

dict = {}

for i, num in enumerate(nums):

if target - num in dict:

return [dict[target-num], i]

dict[num] = i

借助枚举函数，方法同2

出处转载请注明来源，欢迎对文章中的引用来源进行考证，欢迎指出任何有错误或不够清晰的表达。可以在下面评论区评论，也可以邮件至 [email protected]