Product Array Puzzle Java

PROGRAM TO CONSTRUCT A PRODUCT ARRAY WITHOUT DIVISION OPERATOR

class ProductArray {

    void productArray(int arr[], int n)

    {

  

        // Base case

        if (n == 1) {

            System.out.print("0");

            return;

        }

  

        int i, temp = 1;

  

        /* Allocate memory for the product array */

        int prod[] = new int[n];

  

        /* Initialize the product array as 1 */

        for (int j = 0; j < n; j++)

            prod[j] = 1;

  

        /* In this loop, temp variable contains product of

           elements on left side excluding arr[i] */

        for (i = 0; i < n; i++) {

            prod[i] = temp;

            temp *= arr[i];

        }

  

        /* Initialize temp to 1 for product on right side */

        temp = 1;

  

        /* In this loop, temp variable contains product of

           elements on right side excluding arr[i] */

        for (i = n - 1; i >= 0; i--) {

            prod[i] *= temp;

            temp *= arr[i];

        }

  

        /* print the constructed prod array */

        for (i = 0; i < n; i++)

            System.out.print(prod[i] + " ");

  

        return;

    }

  

    /* Driver program to test above functions */

    public static void main(String[] args)

    {

        ProductArray pa = new ProductArray();

        int arr[] = { 10, 3, 5, 6, 2 };

        int n = arr.length;

        System.out.println("The product array is : ");

        pa.productArray(arr, n);

    }

}




OUTPUT

The product array is : 
180 600 360 300 900 

CREDITS: https://www.geeksforgeeks.org/a-product-array-puzzle/