238. Product of Array Except Self

Problem Description:

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.)

Analysis:

本题先顺序遍历整个数组，之后再逆序遍历整个数组，每次保留前所有的数字的成绩。代码如下：

Code:

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