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

题目分析
从左到右乘一遍，再从右到左乘一遍。。。。
输出结果即可

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