Leetcode Problem 238. Product of Array Except Self

238. Product of Array Except Self

Leetcode Solutions

Initialize two arrays L and R of the same length as the input array nums.
Set L[0] to 1 because there are no elements to the left of the first element.
Populate the L array by setting L[i] = L[i - 1] * nums[i - 1] for i from 1 to n - 1.
Set R[n - 1] to 1 because there are no elements to the right of the last element.
Populate the R array by setting R[i] = R[i + 1] * nums[i + 1] for i from n - 2 down to 0.
Initialize the answer array of the same length as the input array nums.
Populate the answer array by setting answer[i] = L[i] * R[i] for each i.
Return the answer array.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen