FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
LeetCode-Solutions/Python/maximum-subarray.py 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
/
Python
/
maximum-subarray.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
17 lines (16 loc) · 426 Bytes
Breadcrumbs
LeetCode-Solutions
/
Python
/
maximum-subarray.py
Copy path
File metadata and controls
17 lines (16 loc) · 426 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
# Time: O(n)
# Space: O(1)
class
Solution
(
object
):
def
maxSubArray
(
self
,
nums
):
"""
:type nums: List[int]
:rtype: int
"""
max_nums
=
max
(
nums
)
if
max_nums
<
0
:
return
max_nums
global_max
,
local_max
=
0
,
0
for
x
in
nums
:
local_max
=
max
(
0
,
local_max
+
x
)
global_max
=
max
(
global_max
,
local_max
)
return
global_max
Back
|
FazBrowse Home
|
New Git URL