【leetcode】238. Product of Array Except Self

题目：

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

Solve it without division and in O(n).

For example, given [1,2,3,4], return [24,12,8,6].

Follow up:

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

思路：

我们以一个4元数组为例，nums=[a1, a2, a3, a4]。 

想在O(n)时间复杂度完成最终的数组输出，res=[a2*a3*a4, a1*a3*a4, a1*a2*a4, a2*a3*a4]。

可以看成是两个数组相乘：

[1, a1, a1*a2, a1*a2*a3]

[a2*a3*a4, a3*a4, a4, 1]

实现：

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