algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-07-06 10:31:29 +08:00
Code Issues Packages Projects Releases Wiki Activity

from __future__ import annotations (#2464)

Browse Source 
* from __future__ import annotations

* fixup! from __future__ import annotations

* fixup! from __future__ import annotations

* fixup! Format Python code with psf/black push

Co-authored-by: github-actions <${GITHUB_ACTOR}@users.noreply.github.com>
This commit is contained in:
Christian Clauss
2020-09-23 13:30:13 +02:00
committed by GitHub
parent 6e6a49d19f
commit 9200a2e543
72 changed files with 275 additions and 250 deletions
Download Patch File Download Diff File Expand all files Collapse all files

4
dynamic_programming/max_sub_array.py
View File

@ -1,7 +1,7 @@
"""
author : Mayank Kumar Jha (mk9440)
"""
from typing import List
from __future__ import annotations
def find_max_sub_array(A, low, high):
@ -38,7 +38,7 @@ def find_max_cross_sum(A, low, mid, high):
return max_left, max_right, (left_sum + right_sum)
def max_sub_array(nums: List[int]) -> int:
def max_sub_array(nums: list[int]) -> int:
"""
Finds the contiguous subarray which has the largest sum and return its sum.