Skip to content
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

Return longestIncreasingSubsequence from dpLongestIncreasingSubsequence #1164

Open
wants to merge 3 commits into
base: master
Choose a base branch
from
+20 −22
Open

Return longestIncreasingSubsequence from dpLongestIncreasingSubsequence #1164

Changes from 1 commit
Commits
Show all changes
3 commits
Select commit Hold shift + click to select a range
e6c4d61
Return longestIncreasingSubsequence from dpLongestIncreasingSubsequence
shola Aug 22, 2024
fcad8fa
fix: whitespace
shola Aug 22, 2024
476a47e
fix: update test label to reflect new function results
shola Aug 22, 2024
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
Prev Previous commit
Next Next commit
fix: whitespace
@shola
shola committed Aug 22, 2024
commit fcad8fa25b74554bc4240784a243c3e0121ef061
2 changes: 1 addition & 1 deletion src/algorithms/sets/longest-increasing-subsequence/dpLongestIncreasingSubsequence.js
View file
Original file line number Diff line number Diff line change
@@ -55,7 +55,7 @@ export default function dpLongestIncreasingSubsequence(sequence) {

while (rightIndex > -1) {
const leftIndex = lengthsArray.findLastIndex((item, idx) => (
item === lengthsArray[rightIndex] - 1 && idx < rightIndex
item === lengthsArray[rightIndex] - 1 && idx < rightIndex
));

longestIncreasingSubsequence.unshift(sequence[rightIndex]);