목록238. Product of Array Except Self (1)

Scribbling

LeetCode: 238. Product of Array Except Self

Relatively straightforward solution, O(N) time O(1) Memory. class Solution: def productExceptSelf(self, nums: List[int]) -> List[int]: numZero, prod, zeroidx = 0, 1, 0 for i, num in enumerate(nums): if num == 0: numZero += 1 zeroidx = i else: prod *= num if numZero >= 2: return [0] * len(nums) if numZero == 1: ret = [0] * len(nums) ret[zeroidx] = prod return ret # backward pass ret = [0] * len(n..
Computer Science/Coding Test 2021. 11. 25. 11:14
이전 Prev 1 Next 다음