Commit c4011a4

committed

Max Product Problem - DP

1 parent 2943b42 commit c4011a4Copy full SHA for c4011a4

File tree

-13

lines changed

-13

lines changed

Lines changed: 5 additions & 13 deletions

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,5 @@`
`1`	`1`	`package com.leetcode.solution;`
`2`	`2`
`3`		`-import java.util.Arrays;`
`4`	`3`	`import java.util.Scanner;`
`5`	`4`
`6`	`5`	`public class MaxProduct {`
`@@ -11,7 +10,7 @@ public static void main(String[] args) {`
`11`	`10`	`int n=sc.nextInt();`
`12`	`11`
`13`	`12`
`14`		`- intarr[] = new int[n];`
	`13`	`+ int[] arr = new int[n];`
`15`	`14`
`16`	`15`	`for (int i=0;i<arr.length;i++){`
`17`	`16`	`arr[i]=sc.nextInt();`
`@@ -20,27 +19,20 @@ public static void main(String[] args) {`
`20`	`19`
`21`	`20`	`MaxValueProdcut mx= new MaxValueProdcut();`
`22`	`21`	`int result= mx.maxProduct(arr);`
`23`		`-`
`24`		`-`
`25`		`- System.out.println(result);`
`26`		`-`
`27`		`-`
`28`		`-`
`29`		`-`
	`22`	`+ System.out.println(result);`
`30`	`23`
`31`	`24`	`}`
`32`		`-`
`33`	`25`	`}`
`34`	`26`	`class MaxValueProdcut {`
`35`	`27`	`public int maxProduct(int[] nums) {`
`36`	`28`	`if(nums == null \|\| nums.length == 0){ return 0;}`
`37`	`29`	`if(nums.length == 1) return nums[0];`
`38`	`30`
`39`	`31`	`int maxProduct = 0, currProduct = 1;`
`40`		`- for(int i = 0; i < nums.length; i++){`
`41`		`- currProduct *= nums[i];`
	`32`	`+ for(int num : nums) {`
	`33`	`+ currProduct *= num;`
`42`	`34`	`maxProduct = Math.max(maxProduct, currProduct);`
`43`		`- if(currProduct == 0) currProduct = 1;`
	`35`	`+ if(currProduct == 0) currProduct = 1;`
`44`	`36`	`}`
`45`	`37`
`46`	`38`	`currProduct = 1;`

Comments

(0)