forked from sunstick/code-street
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmaximum_subarray.cpp
More file actions
32 lines (24 loc) · 801 Bytes
/
maximum_subarray.cpp
File metadata and controls
32 lines (24 loc) · 801 Bytes
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
/*
Find the contiguous subarray within an array (containing at least one number) which has the largest sum.
For example, given the array [−2,1,−3,4,−1,2,1,−5,4],
the contiguous subarray [4,−1,2,1] has the largest sum = 6.
More practice:
If you have figured out the O(n) solution, try coding another solution using the divide and conquer approach, which is more subtle.
*/
class Solution {
public:
int maxSubArray(int A[], int n) {
int sum = 0;
int maxsum = 0;
int maxelem = INT_MIN;
for (int i = 0; i < n; i++) {
if (sum < 0) sum = 0;
sum += A[i];
maxsum = max(maxsum, sum);
maxelem = max(maxelem, A[i]);
}
if (maxelem < 0)
return maxelem;
return maxsum;
}
};