Skip to content

LeetCode-238(chore): cleanup special cases in loops #124

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
WazedKhan merged 1 commit into from
Jun 10, 2026
Merged

LeetCode-238(chore): cleanup special cases in loops #124

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
26 changes: 7 additions & 19 deletions LeetCode/medium/product_except_self_238.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -9,29 +9,17 @@ def productExceptSelf(self, nums: List[int]) -> List[int]:
output = []

# find the prefix first
for index in range(nums_len):
if index == 0:
prefix[index] = nums[index]
elif index < nums_len:
prefix[index] = nums[index] * prefix[index - 1]
prefix[0] = 1
for index in range(1, nums_len):
prefix[index] = nums[index - 1] * prefix[index - 1]

# find the postfix
for index in range(nums_len, 0, -1):

if index == nums_len:
postfix[index - 1] = nums[index - 1]
else:
postfix[index - 1] = nums[index - 1] * postfix[index]
postfix[-1] = 1
for index in range(nums_len - 2, -1, -1):
postfix[index] = nums[index + 1] * postfix[index + 1]

# now find the output
for index in range(nums_len):
if index == 0:
# with index 0 there aren't any prefix
output.append(postfix[index + 1])
elif index == nums_len - 1:
# last element so no postfix
output.append(prefix[index - 1])
else:
output.append(prefix[index - 1] * postfix[index + 1])
output.append(prefix[index] * postfix[index])

return output
Loading