Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 5ac85a2

Browse files
committed
Update READMEs.
1 parent 294bd2a commit 5ac85a2

File tree

1 file changed

+3
-0
lines changed
  • src/algorithms/sets/maximum-subarray

1 file changed

+3
-0
lines changed

‎src/algorithms/sets/maximum-subarray/README.md

Lines changed: 3 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -6,6 +6,8 @@ which has the largest sum, where,
66

77
![Maximum subarray](https://wikimedia.org/api/rest_v1/media/math/render/svg/e8960f093107b71b21827e726e2bad8b023779b2)
88

9+
![Maximum subarray](https://www.geeksforgeeks.org/wp-content/uploads/kadane-Algorithm.png)
10+
911
## Example
1012

1113
The list usually contains both positive and negative numbers along
@@ -17,3 +19,4 @@ with the largest sum is `4, −1, 2, 1`, with sum `6`.
1719

1820
- [Wikipedia](https://en.wikipedia.org/wiki/Maximum_subarray_problem)
1921
- [YouTube](https://www.youtube.com/watch?v=ohHWQf1HDfU&list=PLLXdhg_r2hKA7DPDsunoDZ-Z769jWn4R8)
22+
- [GeeksForGeeks](https://www.geeksforgeeks.org/largest-sum-contiguous-subarray/)

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /