-
Notifications
You must be signed in to change notification settings - Fork 0
/
Maximum Subarray.cpp
40 lines (32 loc) · 1.09 KB
/
Maximum 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
/* Given an integer array nums, find the
subarray
with the largest sum, and return its sum.
Example 1:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4]
Output: 6
Explanation: The subarray [4,-1,2,1] has the largest sum 6.
Example 2:
Input: nums = [1]
Output: 1
Explanation: The subarray [1] has the largest sum 1.
Example 3:
Input: nums = [5,4,-1,7,8]
Output: 23
Explanation: The subarray [5,4,-1,7,8] has the largest sum 23.
Constraints:
1 <= nums.length <= 105
-104 <= nums[i] <= 104 */
//Kadane Algorithm approach: if overall sum become negative then it is better to reinitialize sum to zero , beacuse there might be a possibility that later we will get positive sum , but if we move with negative sum then it only decrease our positive sum , so it better to reinitialize sum to 0 means start new subarray from next index ,
class Solution {
public:
int maxSubArray(vector<int>& nums) {
int ans = INT_MIN;
int sum = 0;
for(int i = 0; i<nums.size(); i++){
sum += nums[i];
ans = max(ans,sum);
if(sum<0)sum = 0;
}
return ans;
}
};