Commit310dc1c

authored

Update Product of Array Except Self - Leetcode 238.py

1 parent4ee2d06 commit310dc1cCopy full SHA for 310dc1c

File tree

+30

-0

lines changed

+30

-0

lines changed

Lines changed: 30 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -38,3 +38,33 @@ def productExceptSelf(self, nums: List[int]) -> List[int]:`
`38`	`38`
`39`	`39`	`# Time Complexity: O(n)`
`40`	`40`	`# Space Complexity: O(n)`
	`41`	`+`
	`42`	`+`
	`43`	`+# Optimal Solution for Bootcamp`
	`44`	`+classSolution:`
	`45`	`+defproductExceptSelf(self,nums:List[int])->List[int]:`
	`46`	`+n=len(nums)`
	`47`	`+answer= [0]*n`
	`48`	`+`
	`49`	`+L=1`
	`50`	`+left_product= [0]*n`
	`51`	`+`
	`52`	`+foriinrange(n):`
	`53`	`+left_product[i]=L`
	`54`	`+L*=nums[i]`
	`55`	`+`
	`56`	`+`
	`57`	`+R=1`
	`58`	`+right_product= [0]*n`
	`59`	`+`
	`60`	`+foriinrange(n-1,-1,-1):`
	`61`	`+right_product[i]=R`
	`62`	`+R*=nums[i]`
	`63`	`+`
	`64`	`+`
	`65`	`+foriinrange(n):`
	`66`	`+answer[i]=left_product[i]*right_product[i]`
	`67`	`+`
	`68`	`+returnanswer`
	`69`	`+# Time Complexity: O(n)`
	`70`	`+# Space Complexity: O(n)`

Comments

(0)