class Solution:
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
result = {}
for i in range(len(nums)):
if target - nums[i] not in result:
result[nums[i]] = i
else:
return [result[target - nums[i]], i]
return [-1, -1]
LeetCode 1. Two Sum (Easy) LeetCode 1. Two Sum (Easy) 原题链...
Two sum From https://leetcode.com/problems/two-sum/descri...
Two Sum I https://leetcode.com/problems/two-sum/#/descrip...
1. Two Sum 题目:https://leetcode.com/problems/two-sum/ 难度: ...
1. Two Sum[https://leetcode-cn.com/problems/two-sum/] 字典（...
LeetCode 371 Sum of Two Integers ========================...
LeetCode Problems' Solutions LeetCode Problems 1. Two Sum...
371. Sum of Two Integers【思路】： 位运算 [leetcode] 371. Sum of ...
leetcode[https://leetcode-cn.com/problems/two-sum/submiss...
https://leetcode.com/problems/two-sum/[https://leetcode.c...
本文标题：Leetcode 之 Two Sum
本文链接：https://www.haomeiwen.com/subject/yaujmxtx.html
网友评论