Leetcode 1. Two SUM（两数之和）Python

1. 方法一
   Class Solution:
   def twoSum(self, nums: List[int], target: int) -> List[int]:
   n=len(nums)
   d={}
   for i in range(n):
   a = target - nums[i]
   if nums[i] in d:
   return d[nums[i]],i
   else:
   d[a]=i

2. 方法二
   class Solution:
   def twoSum(self, nums: List[int], target: int) -> List[int]:
   n=len(nums)
   for i in range(0,n):
   a = target - nums[i]
   if a in nums:
   j = nums.index(a)
   if i == j:
   continue
   else:
   return i,j
   break
   else:
   continue

3. 方法三
   class Solution:
   def twoSum(self, nums: List[int], target: int) -> List[int]:
   n=len(nums)
   for i in range(0,n):
   for j in range(i+1,n):
   if target-nums[i]==nums[j]:
   return i,j
   break
   else:
   continue

最后

以上就是大力小刺猬为你收集整理的Leetcode 1. Two SUM（两数之和）Python的全部内容，希望文章能够帮你解决Leetcode 1. Two SUM（两数之和）Python所遇到的程序开发问题。

如果觉得靠谱客网站的内容还不错，欢迎将靠谱客网站推荐给程序员好友。