FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-NOTES/Algorithms/53.Maximum-Subarray/solution.cpp at master · moranzcw/LeetCode-NOTES · GitHub
moranzcw
/
LeetCode-NOTES
Public
Notifications
You must be signed in to change notification settings
Fork
77
Star
201
Code
Issues
1
Pull requests
0
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
LeetCode-NOTES
/
Algorithms
/
53.Maximum-Subarray
/
solution.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
21 lines (19 loc) · 397 Bytes
Breadcrumbs
LeetCode-NOTES
/
Algorithms
/
53.Maximum-Subarray
/
solution.cpp
Copy path
File metadata and controls
21 lines (19 loc) · 397 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
19
20
21
class
Solution
{
public:
int
maxSubArray
(
int
A[],
int
n)
{
int
ThisSum,MaxSum;
MaxSum = A[
0
];
ThisSum =
0
;
for
(
int
j=
0
;j<n;j++)
{
ThisSum += A[j];
if
( ThisSum > MaxSum)
MaxSum = ThisSum;
if
(ThisSum <
0
)
ThisSum =
0
;
}
return
MaxSum;
}
};
Back
|
FazBrowse Home
|
New Git URL