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

比较懒，明明很简单的题，动笔写一下就很清楚。这个是空间复杂度O(1) 的写法。正常也应该能想到这个的。诶

代码：

public int[] productExceptSelf(int[] nums) {
        if(nums == null || nums.length == 0) return new int[0];
        
        int[] result = new int[nums.length];
        for(int i=0;i<result.length;i++){
            result[i] = 1;
        }
        int value = 1;
        for(int i=1;i<nums.length;i++){
            value = value * nums[i-1];
            result[i] = value; 
        }
        value = 1;
        for(int i=nums.length-2;i>=0;i--){
            value = value * nums[i+1];
            result[i] = result[i] * value;
        }
        return result;
    }