Skip to content

Typo correction #249

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
shl505 wants to merge 1 commit into
base: main
Choose a base branch
from
Open

Typo correction #249

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
4 changes: 2 additions & 2 deletions algorithms/python/Kadane's_Algorithm.py
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -2,7 +2,7 @@

# Given an integer array nums, we find the contiguous subarray (containing at least one number) which has the largest sum and return its sum.

def maxSubArray(nums: List[int]) -> int:
def maxSubArray(nums: list[int]) -> int:
if not nums:
return 0
if len(nums)==1:
Expand Down Expand Up @@ -32,4 +32,4 @@ def maxSubArray(nums: List[int]) -> int:
print("Maximum Sum =",maxSubArray(nums)) # 6 because [4,-1,2,1] has the largest sum = 6.
print("Start Index of Maximum Subarray =",start) # 3
print("End Index of Maximum Subarray =",end) # 6
print("Maximum Subarray =",nums[start:end+1]) # [4,-1,2,1]
print("Maximum Subarray =",nums[start:end+1]) # [4,-1,2,1]