[LeetCode] Product of Array Except Self

문제: 

 

풀이 : 

 

class Solution:
    def productExceptSelf(self, nums: List[int]) -> List[int]:
        solution = [1] * (range(len(nums)) 
        for i in range(len(nums)): 
        	solution[i] = solution[i-1] * nums[i-1] 
        postfix = 1
        for i in range(len(nums)-1, -1,-1)): 
        	solution[i] *= postfix
            postfix *= nums[i]
		return solution