Commit6ec2fe6

authored

Update longest_increasing_subsequence.md

Small improvement of the wording of a question

1 parente8b714d commit6ec2fe6Copy full SHA for 6ec2fe6

File tree

-1

lines changed

-1

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -174,7 +174,7 @@ We will again gradually process the numbers, first $a[0]$, then $a[1]$, etc, and`
`174`	`174`	`$$`
`175`	`175`
`176`	`176`	`When we process $a[i]$, we can ask ourselves.`
`177`		`-What have theconditionsto be, that we write the current number $a[i]$ into the $d[0 \dots n]$ array?`
	`177`	`+Under whatconditionsshould we write the current number $a[i]$ into the $d[0 \dots n]$ array?`
`178`	`178`
`179`	`179`	`We set $d[l] = a[i]$, if there is a longest increasing sequence of length $l$ that ends in $a[i]$, and there is no longest increasing sequence of length $l$ that ends in a smaller number.`
`180`	`180`	`Similar to the previous approach, if we remove the number $a[i]$ from the longest increasing sequence of length $l$, we get another longest increasing sequence of length $l -1$.`

Comments

(0)