-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathLeetcode152.cpp
More file actions
129 lines (114 loc) · 3.7 KB
/
Leetcode152.cpp
File metadata and controls
129 lines (114 loc) · 3.7 KB
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
127
128
129
// Leetcode152.cpp : This file contains the 'main' function. Program execution begins and ends there.
//
#include <iostream>
#include <vector>
using namespace::std;
int maxProduct(vector<int>& nums) {
long maxP = 0;
if (nums.size() == 1) return nums[0];
vector<int> data;
long product = 0;
int negNum = 0;
for (int i = 0; i < nums.size(); ++i)
{
if (nums[i] != 0)
{
if (nums[i] > 0) product = product == 0 ? nums[i] : product * nums[i];
if (nums[i] < 0)
{
if (product > 0)
{
data.push_back(product);
product = 0;
}
data.push_back(nums[i]);
++negNum;
}
}
if(nums[i] == 0 || i== nums.size()-1)
{
if (product > 0) data.push_back(product);
if (negNum % 2 == 0)
{
long product = 0;
for (auto num : data)
product = product == 0 ? num : product * num;
maxP = max(maxP, product);
}
else
{
if (negNum == 1)
{
long product = 0;
for (auto num : data)
{
if (num > 0) product = product == 0 ? num : product * num;
else
{
maxP = max(maxP, product);
product = 0;
}
}
maxP = max(maxP, product);
}
else
{
int firstIndex = 0, lastIndex = 0;
long p1 = 1, p2 = 1, p3 = 1;
for (int i = 0; i < data.size(); ++i)
{
if (data[i] < 0) { firstIndex = i; break; }
}
for (int i = data.size()-1; i >= 0; --i)
{
if (data[i] < 0) { lastIndex = i; break; }
}
for (int i = 0; i <= firstIndex; ++i) p1 *= data[i];
for (int i = firstIndex + 1; i <= lastIndex - 1; ++i) p2 *= data[i];
for (int i = lastIndex; i < data.size(); ++i) p3 *= data[i];
maxP = max(maxP, max(p1 * p2, p2 * p3));
}
}
data.clear();
product = 0;
negNum = 0;
}
}
return maxP;
}
int maxProduct(vector<int>& nums)
{
int maxi = INT_MIN;
int prod = 1;
for (int i = 0; i < nums.size(); i++)
{
prod *= nums[i];
maxi = max(prod, maxi);
if (prod == 0)
prod = 1;
}
prod = 1;
for (int i = nums.size() - 1; i >= 0; i--)
{
prod *= nums[i];
maxi = max(prod, maxi);
if (prod == 0)
prod = 1;
}
return maxi;
}
int main()
{
vector<int> nums = { 0,-2,0 };
int res = maxProduct(nums);
std::cout << "Hello World!\n";
}
// Run program: Ctrl + F5 or Debug > Start Without Debugging menu
// Debug program: F5 or Debug > Start Debugging menu
// Tips for Getting Started:
// 1. Use the Solution Explorer window to add/manage files
// 2. Use the Team Explorer window to connect to source control
// 3. Use the Output window to see build output and other messages
// 4. Use the Error List window to view errors
// 5. Go to Project > Add New Item to create new code files, or Project > Add Existing Item to add existing code files to the project
// 6. In the future, to open this project again, go to File > Open > Project and select the .sln file