题目
class Solution(object):
def twoSum(self, nums, target):
“””
:type nums: List[int]
:type target: int
:rtype: List[int]
“””
for i in range(len(nums)):
if (target-nums[i])in nums :
if i!=nums.index(target-nums[i]):
return [i,nums.index(target-nums[i])]
leetcode two sum
最新推荐文章于 2024-10-05 12:29:44 发布