![](https://img1.daumcdn.net/thumb/R750x0/?scode=mtistory2&fname=https%3A%2F%2Fblog.kakaocdn.net%2Fdn%2Fb3jfTD%2Fbtr115rwvkR%2FWdPus1NJWo1tA1wcBGRanK%2Fimg.png)
LeetCode-1 Two Sum : target과 일치하는 리스트 두개의 합 note : OMyAnswer (O(n * n))class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: len_nums = len(nums) if len_nums==2: return [0,1] for i in range(len(nums)): for j in range(i+1,len(nums)): if target==(nums[i]+nums[j]): return [i, j] Result : 3649ms Memory: 14.9mbAnswer O(n * n) (in의 시간 복잡도 n)class Solution: def twoSum(self, nums:..