-
Notifications
You must be signed in to change notification settings - Fork 0
/
Maximum_Product_Subarray.cpp
126 lines (118 loc) · 2.82 KB
/
Maximum_Product_Subarray.cpp
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
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
#include <iostream>
/*
*the max product happend on this 3 kinds of situation:
* 0 (* * -* ****** -* **) 0
* 0 (* * -* ****** )-* ** 0
* 0 * * -*( ****** -* **) 0
*
* */
using namespace std;
class Solution
{
void findmaxP(int A[], int i)
{
#if 0
cout << "A[i]=" << A[i]<<endl;
cout << "tmp_o=" << tmp_o<<endl;
cout << "tmp_n=" << tmp_n<<endl;
cout << "tmp_l=" << tmp_l<<endl;
#endif
if (A[i] > 0)
{
tmp_n *= A[i];
bool_n = true;
tmp_l *= A[i];
bool_l = true;
}
else if (A[i] == 0)
{
if (bool_n)
if (product < tmp_n)
product = tmp_n;
if (bool_l)
if (product < tmp_l)
product = tmp_l;
/*
if (product < (tmp_l > tmp_n ?tmp_l:tmp_n))
product = tmp_l > tmp_n ?tmp_l:tmp_n;
*/
tmp_n = 1;
tmp_l = 1;
bool_n = false;
bool_l = false;
firstnegtive = 1;
}
else if (A[i] < 0)
{
if (tmp_n < 0)
{
tmp_n *= A[i];
bool_n = true;
}
else
{
if (bool_n)
if (product < tmp_n)
product = tmp_n;
/*
if (product < tmp_l > tmp_n ?tmp_l:tmp_n )
product = tmp_l > tmp_n ?tmp_l:tmp_n;
*/
tmp_n *= A[i];
}
if (firstnegtive == 1)
{
tmp_l = 1;
firstnegtive = 0;
}
else
{
tmp_l *= A[i];
bool_l = true;
}
}
if (product < A[i])
product = A[i];
}
public:
long long product ;
long long tmp_n ;
bool bool_n;
long long tmp_l ;
bool bool_l;
int firstnegtive;
int maxProduct(int A[], int n)
{
firstnegtive = 1;
product = -2147483648;
tmp_n =1;
bool_n = false;
tmp_l =1;
bool_l = false;
for (int i = 0; i < n; i++)
{
findmaxP(A,i);
}
if (bool_n)
if (product < tmp_n)
product = tmp_n;
if (bool_l)
if (product < tmp_l)
product = tmp_l;
/*
if (product < (tmp_l > tmp_n ?tmp_l:tmp_n))
product = tmp_l > tmp_n ?tmp_l:tmp_n;
*/
return product;
}
};
#if 1
int main()
{
int a[] = {-1, 0,-1,2,-3,1,2,3,-2};
//int a[] = {2, 3, -2, 4, -3, 0,2, -2, 4, 8, 4 ,-9, -8,2, 0,2 ,3,4};
Solution test;
cout << test.maxProduct(a, 9) << endl;
return 0;
}
#endif