[LeetCode][Python3] 1. Two Sum

Problem :

https://leetcode.com/problems/two-sum/description/

My Solution :

class Solution:

def twoSum(self, nums, target):

"""

:type nums: List[int]

:type target: int

:rtype: List[int]

"""

cache = {}

for i, num in enumerate(nums):

if target - num in cache:

return [cache[target-num], i]

cache[num] = i

Comment :

HackerRank는 Easy 문제를 거의 다 풀어본 듯 하니, 오늘부터 LeetCode Easy 문제를 풀어볼 생각이다.