FilesExpand file tree

 master

/

MaximumProductSubarray.java

Copy path

BlameMore file actions

BlameMore file actions

Latest commit

 

History

History

History

28 lines (26 loc) · 914 Bytes

 master

/

MaximumProductSubarray.java

Top

File metadata and controls

• Code
• Blame

28 lines (26 loc) · 914 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

24

25

26

27

28

/*

Author: King, wangjingui@outlook.com

Date: Oct 06, 2014

Problem: Maximum Product Subarray

Difficulty: Medium

Source: https://oj.leetcode.com/problems/maximum-product-subarray/

Notes:

Find the contiguous subarray within an array (containing at least one number) which has the largest product.

For example, given the array [2,3,-2,4],

the contiguous subarray [2,3] has the largest product = 6.

*/

public class Solution {

public int maxProduct(int[] A) {

if (A.length <= 0) {

return 0;

}

int maxVal = A[0], minVal = A[0], res = A[0];

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

int tmpVal = maxVal;

maxVal = Math.max(Math.max(maxVal * A[i], minVal * A[i]), A[i]);

minVal = Math.min(Math.min(tmpVal * A[i], minVal * A[i]), A[i]);

res = Math.max(res, maxVal);

}

return res;

}

}