WOONY's 인사이트

Java Solution class Solution { public int maxSubArray(int[] nums) { //Solution 1: my solution /** Runtime: 9 ms, faster than 5.84% of Java online submissions for Maximum Subarray. Memory Usage: 74.1 MB, less than 41.86% of Java online submissions for Maximum Subarray. 시간복잡도: O(n) - 아래 나올 Solution 2와 동일한 시간복잡도이나 매번 dp 값을 갱신하기 위해 참조해야 하는 점에서 중간에 품이 들어가는 듯. 공간복잡도: O(n) - dp array를 n개 원소만큼 생성해야 함 */..

Solution 1 from collections import defaultdict class Solution: #Solution 1 ''' Runtime: 67 ms, faster than 83.33% of Python3 online submissions for Two Sum. Memory Usage: 16.2 MB, less than 9.74% of Python3 online submissions for Two Sum. ''' def twoSum(self, nums: List[int], target: int) -> List[int]: dic = defaultdict(list) for idx, val in enumerate(nums): dic[val].append(idx) for idx, val in ..