238 Product of Array Except Self

题目链接：https://leetcode.com/problems/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]

参考链接：http://blog.csdn.net/wzy_1988/article/details/46916179

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

17 / 17 test cases passed.
Status: Accepted
Runtime: 476 ms