FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/C++/maximum-subarray.cpp at master · Monika-R/LeetCode-Solutions · GitHub
Monika-R
/
LeetCode-Solutions
Public
forked from
kamyu104/LeetCode-Solutions
Notifications
You must be signed in to change notification settings
Fork
0
Star
0
Code
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode-Solutions
/
C++
/
maximum-subarray.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
18 lines (17 loc) · 468 Bytes
Breadcrumbs
LeetCode-Solutions
/
C++
/
maximum-subarray.cpp
Copy path
File metadata and controls
18 lines (17 loc) · 468 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
//
Time: O(n)
//
Space: O(1)
class
Solution
{
public:
int
maxSubArray
(vector<
int
>& nums) {
const
auto
& max_num = *
max_element
(nums.
cbegin
(), nums.
cend
());
if
(max_num <
0
) {
return
max_num;
}
int
global_max =
0
, local_max =
0
;
for
(
const
auto
&x : nums) {
local_max =
std::max
(
0
, local_max + x);
global_max =
std::max
(global_max, local_max);
}
return
global_max;
}
};
Back
|
FazBrowse Home
|
New Git URL