-
Notifications
You must be signed in to change notification settings - Fork 3
Expand file tree
/
Copy pathmaxTwoSubArrays.cpp
More file actions
60 lines (51 loc) · 1.44 KB
/
maxTwoSubArrays.cpp
File metadata and controls
60 lines (51 loc) · 1.44 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
// Example program
#include <iostream>
#include <string>
#include <vector>
#include <limits>
using namespace std;
int maxTwoSubArrays(vector<int> nums) {
// write your code here
int n = nums.size();
if(n == 0) {
return 0;
}
vector<int> leftMax(n, numeric_limits<int>::min());
vector<int> rightMax(n, numeric_limits<int>::min());
int currSum = 0;
for(int i = 0; i < n; i++) {
if(currSum >= 0) {
currSum += nums[i];
}
else {
currSum = nums[i];
}
leftMax[i] = max(leftMax[i], currSum);
cout<<"left["<<i<<"] :"<<leftMax[i]<<" ";
}
cout<<endl;
currSum = 0;
for(int i = n-1; i >= 0; i--) {
if(currSum >= 0) {
currSum += nums[i];
}
else {
currSum = nums[i];
}
rightMax[i] = max(rightMax[i], currSum);
cout<<"right["<<i<<"] :"<<rightMax[i]<<" ";
}
cout<<endl;
int maxSum = numeric_limits<int>::min();
for(int i = 0; i < n-1; i++) {
int sum = leftMax[i] + rightMax[i+1];
maxSum = max(maxSum, sum);
}
return maxSum;
}
int main()
{
vector<int> nums = {1,3,-1,2,-1,2};
cout <<maxTwoSubArrays(nums)<<endl;
return 0;
}