238. Product of Array Except Self

题目

Given an array nums of n integers where n > 1, return an array output such that output[i] is equal to the product of all the elements of nums except nums[i].

Example:
Input: [1,2,3,4]
Output: [24,12,8,6]
Note: Please solve it without division and in O(n).

Follow up:
Could you solve it with constant space complexity? (The output array does not count as extra space for the purpose of space complexity analysis.)

我的想法

注意！！！不能用除法！！！
对于i从前往后算i-1的乘积，再从后往前乘上反向的乘积

class Solution {
    public int[] productExceptSelf(int[] nums) {
        int[] forward = new int[nums.length];
        int[] backward = new int[nums.length];
        int[] res = new int[nums.length];
        forward[0] = 1;
        backward[nums.length - 1] = 1;
        for(int i = 1; i < nums.length; i++) {
            forward[i] = forward[i-1] * nums[i-1];
        }
        res[nums.length - 1] = forward[nums.length - 1];
        for(int i = nums.length - 2; i >= 0; i--) {
            backward[i] = backward[i+1] * nums[i+1];
            res[i] = backward[i] * forward[i];
        }
        return res;
    }
}

follow up:

class Solution {
    public int[] productExceptSelf(int[] nums) {
        int[] res = new int[nums.length];
        int backward = 1;
        res[0] = 1;
        for(int i = 1; i < nums.length; i++) {
            res[i] = res[i-1] * nums[i-1];
        }
        for(int i = nums.length - 1; i >= 0; i--) {
            res[i] = res[i] * backward;
            backward *= nums[i];
        }
        return res;
    }
}

解答