deven/leetcode
1
0
Fork 0
mirror of https://github.com/devenperez/leetcode.git synced 2026-06-15 09:57:09 +00:00
Code Issues Packages Projects Releases Wiki Activity

Time: 38 ms (97.94%), Space: 25 MB (96.97%) - LeetHub

Browse Source
This commit is contained in:
Deven
2024-10-21 09:13:24 -04:00
parent 046de15e59
commit bab76ad214
1 changed files with 15 additions and 0 deletions
Download Patch File Download Diff File Expand all files Collapse all files
0238-product-of-array-except-self/0238-product-of-array-except-self.py
+15
View File
@@ -0,0 +1,15 @@
class Solution:
def productExceptSelf(self, nums: List[int]) -> List[int]:
n = len(nums)
left = [1] * len(nums)
right = [1] * len(nums)
for i in range(len(nums)):
if i > 0:
left[i] = left[i - 1] * nums[i - 1]
if n - i < len(nums):
right[n - i - 1] = right[n - i] * nums[n - i]
return [left[i] * right[i] for i in range(len(nums))]