FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
leetcode-algorithms/python/maximum_sum_subarray.py at master · anishLearnsToCode/leetcode-algorithms · GitHub
anishLearnsToCode
/
leetcode-algorithms
Public
Notifications
You must be signed in to change notification settings
Fork
17
Star
98
Code
Issues
0
Pull requests
0
Discussions
Actions
Projects
Security and quality
0
Insights
Additional navigation options
Code
Issues
Pull requests
Discussions
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
leetcode-algorithms
/
python
/
maximum_sum_subarray.py
Copy path
More file actions
More file actions
Latest commit
History
History
History
12 lines (10 loc) · 355 Bytes
Breadcrumbs
leetcode-algorithms
/
python
/
maximum_sum_subarray.py
Copy path
File metadata and controls
12 lines (10 loc) · 355 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
# Kadane's Algorithm
from
typing
import
List
class
Solution
:
def
maxSubArray
(
self
,
array
:
List
[
int
])
->
int
:
max_sum
,
current_sum
=
-
float
(
'infinity'
),
0
for
element
in
array
:
current_sum
+=
element
max_sum
=
max
(
current_sum
,
max_sum
)
current_sum
=
max
(
current_sum
,
0
)
return
int
(
max_sum
)
Back
|
FazBrowse Home
|
New Git URL