[leetcode] 1. Two Sum

leetcode.com/problems/two-sum/submissions/

Two Sum - LeetCode

 

내 풀이

for i in range(len(nums)):
	t = target - nums[i]
    if t in nums and nums.index(t) != i:
    	return nums.index(t), i

 

해쉬를 이용한 풀이

class Solution:
    def twoSum(self, nums: List[int], target: int) -> List[int]:
        
        nums_map = {}
        
        for i, num in enumerate(nums):
            nums_map[num] = i
        
        for i, num in enumerate(nums):
            if target - num in nums_map and i != nums_map[target-num]:
                return nums.index(num), nums_map[target-num]