공대생의 비망록

class Solution: def merge(self, nums1: List[int], m: int, nums2: List[int], n: int) -> None: """ Do not return anything, modify nums1 in-place instead. """ if n == 0: return if m == 0: # nums1 = nums2 # This will not meet the in-place requirement for i in range(n): # To meet the in-place requirement nums1[i] = ..

중첩 for-loop 사용: class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: for i in range(len(nums)): for j in range (i + 1, len(nums)): if nums[i] + nums[j] == target: return [i, j]시간복잡도 개선을 위해 Dictionary 자료구조를 활용하는 방식: class Solution: def twoSum(self, nums: List[int], target: int) -> List[int]: desiredTarget = {..