class Solution:
def twoSum(self, nums: List[int], target: int) -> List[int]:
for i in range (len(nums)):
for j in range (i+1,len(nums)):
if nums[i]+nums[j]==target:
return [i,j]
思路:遍历数组元素,直到找到第一对和为目标值的两个数。