Scribd Logo
Upload

Welcome to Scribd!

  • Maximum Product Ofsub Array

    Uploaded by

    Krijay
    10 views2 pages
    This Java code finds the maximum product subarray in an integer array. It defines a maxProductSubArray method that takes an integer array as a parameter and returns the maximum product. The method iterates through the array, tracking the maximum product seen so far using three variables - prod1, prod2, and result. It returns result, achieving linear time complexity of O(n) compared to the original O(n^2) solution. The main method calls maxProductSubArray on a sample array and prints the output.

    Original Description:

    Copyright

    © © All Rights Reserved

    Available Formats

    DOCX, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    This Java code finds the maximum product subarray in an integer array. It defines a maxProductSubArray method that takes an integer array as a parameter and returns the maximum product. The method iterates through the array, tracking the maximum product seen so far using three variables - prod1, prod2, and result. It returns result, achieving linear time complexity of O(n) compared to the original O(n^2) solution. The main method calls maxProductSubArray on a sample array and prints the output.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    10 views2 pages

    Maximum Product Ofsub Array

    Uploaded by

    Krijay
    This Java code finds the maximum product subarray in an integer array. It defines a maxProductSubArray method that takes an integer array as a parameter and returns the maximum product. The method iterates through the array, tracking the maximum product seen so far using three variables - prod1, prod2, and result. It returns result, achieving linear time complexity of O(n) compared to the original O(n^2) solution. The main method calls maxProductSubArray on a sample array and prints the output.

    Copyright:

    © All Rights Reserved
    Download as DOCX, PDF, TXT or read online from Scribd
    Flag for inappropriate content
    Download as docx, pdf, or txt
    of 2

    import java.util.

    *;

    public class Main

    static int maxProductSubArray(int arr[]) {

    int result = arr[0];

    for(int i=0;i<arr.length-1;i++) {

    int p = arr[i];

    for(int j=i+1;j<arr.length;j++) {

    result = Math.max(result,p);

    p *= arr[j];

    result = Math.max(result,p);

    return result;

    public static void main(String[] args) {

    int nums[] = {1,2,-3,0,-4,-5};

    int answer = maxProductSubArray(nums)i;

    System.out.print("The maximum product subarray is: "+answer);

    Time complexity: o(n^2)

    import java.util.*;

    public class Main

    static int maxProductSubArray(int arr[]) {

    int prod1 = arr[0],prod2 = arr[0],result = arr[0];

    for(int i=1;i<arr.length;i++) {
    int temp = Math.max(arr[i],Math.max(prod1*arr[i],prod2*arr[i]));

    prod2 = Math.min(arr[i],Math.min(prod1*arr[i],prod2*arr[i]));

    prod1 = temp;

    result = Math.max(result,prod1);

    return result;

    public static void main(String[] args) {

    int nums[] = {1,2,-3,0,-4,-5};

    int answer = maxProductSubArray(nums);

    System.out.print("The maximum product subarray is: "+answer);

    Time complexity o(n)

    You might also like