https://leetcode.com/problems/two-sum/description/ 내 코드# 시간복잡도 O(N^2) class Solution(object): def twoSum(self, nums, target): result = [] for i in range(0, len(nums)): for j in range(i+1, len(nums)): if nums[i] + nums[j] == target: result += [i, j] return result# 시간복잡도 O(N) class Solution(object): def twoSum(self, nums, target): hash_table = {} # 해시 테이블 -> 딕셔너리 for i, num in enumerate(nums): com..
