Commit 7ea6e9a

committed

implemented brute force solution to find max product subarray

1 parent 0c71c77 commit 7ea6e9aCopy full SHA for 7ea6e9a

File tree

+23

-1

lines changed

+23

-1

lines changed

Lines changed: 23 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -59,13 +59,35 @@ int MaxProDP(int arr[],int size)`
`59`	`59`	`return maxPro;`
`60`	`60`	`}//T(n) = O(n)`
`61`	`61`
	`62`	`+int MaxProBrute(int arr[],int size)`
	`63`	`+{`
	`64`	`+ int max = INT_MIN;`
	`65`	`+`
	`66`	`+ int pro;`
	`67`	`+`
	`68`	`+ for(int i = 0 ; i < size; i++)`
	`69`	`+ {`
	`70`	`+ pro = 1;`
	`71`	`+`
	`72`	`+ for(int j = i ; j < size; j++)`
	`73`	`+ {`
	`74`	`+ pro *= arr[j];`
	`75`	`+`
	`76`	`+ if(pro > max)`
	`77`	`+ max = pro;`
	`78`	`+ }`
	`79`	`+ }`
	`80`	`+`
	`81`	`+ return max;`
	`82`	`+}`
	`83`	`+`
`62`	`84`	`int main()`
`63`	`85`	`{`
`64`	`86`	`int arr[] = {0,0,-1,-4};`
`65`	`87`
`66`	`88`	`int size = sizeof(arr)/sizeof(arr[0]);`
`67`	`89`
`68`		`- cout<<MaxProDP(arr,size);`
	`90`	`+ cout<<MaxProBrute(arr,size);`
`69`	`91`
`70`	`92`	`return 0;`
`71`	`93`	`}`

Comments

(0)