*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[] array1 = new int[nums.length];
        int[] array2 = new int[nums.length];
        int[] result = new int[nums.length];

        array1[0]=1;
        array2[nums.length-1]=1;
        for(int i = 1; i<nums.length;i++)
        {
            array1[i]=array1[i-1]*nums[i-1];
            
        }
        for(int i=nums.length-2;i>=0;i--)
        {
            array2[i]=array2[i+1]*nums[i+1];
        }
        for(int i=0;i<nums.length;i++)
        {
            result[i]=array1[i]*array2[i];
        }
        
        return result;
        
        
    }
}