1. Two Sum
題目:
https://leetcode.com/problems/two-sum/
難度:
Easy
覺得異常聰明的AC解法
class Solution(object):
def twoSum(self, nums, target):
"""
:type nums: List[int]
:type target: int
:rtype: List[int]
"""
lookup = {}
for i, num in enumerate(nums):
if target - num in lookup:
return [lookup[target - num],i]
lookup[num] = i
return []
