Skip to content

Commit 86b1324

Browse files
authored
Merge pull request #1189 from Nil-Cipher/patch-1
Fixed a typo in longest_increasing_subsequence.md
2 parents b551119 + ff5f70a commit 86b1324

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

src/sequences/longest_increasing_subsequence.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -46,7 +46,7 @@ Then there are two options:
4646

4747
- $d[i] = 1$: the required subsequence consists only of the element $a[i]$.
4848

49-
- $d[i] > 1$: The subsequence will end it $a[i]$, and right before it will be some number $a[j]$ with $j < i$ and $a[j] < a[i]$.
49+
- $d[i] > 1$: The subsequence will end at $a[i]$, and right before it will be some number $a[j]$ with $j < i$ and $a[j] < a[i]$.
5050

5151
It's easy to see, that the subsequence ending in $a[j]$ will itself be one of the longest increasing subsequences that ends in $a[j]$.
5252
The number $a[i]$ just extends that longest increasing subsequence by one number.

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy