mathdatech/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-01-18 08:17:01 +00:00
Code Issues Packages Projects Releases Wiki Activity

Fix dynamic_programming/longest_increasing_subsequence.py (#12517)

Browse Source 
* Fix #12510

* Added the doctest mentioned in the issue

* [pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

* Fixed Grammer Mistake

* Update longest_increasing_subsequence.py

* Update longest_increasing_subsequence.py

* Update longest_increasing_subsequence.py

* Update longest_increasing_subsequence.py

---------

Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com>
Co-authored-by: Maxim Smolskiy <mithridatus@mail.ru>
This commit is contained in:
Sanjay Muthu 2025-01-13 05:05:22 +05:30 committed by GitHub
parent b653aee627
commit 4c92de5e03
No known key found for this signature in database
GPG Key ID: B5690EEEBB952194
1 changed files with 4 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
dynamic_programming/longest_increasing_subsequence.py
View File

@ -24,8 +24,10 @@ def longest_subsequence(array: list[int]) -> list[int]: # This function is recu
[10, 22, 33, 41, 60, 80] [10, 22, 33, 41, 60, 80]
>>> longest_subsequence([4, 8, 7, 5, 1, 12, 2, 3, 9]) >>> longest_subsequence([4, 8, 7, 5, 1, 12, 2, 3, 9])
[1, 2, 3, 9] [1, 2, 3, 9]
>>> longest_subsequence([28, 26, 12, 23, 35, 39])
[12, 23, 35, 39]
>>> longest_subsequence([9, 8, 7, 6, 5, 7]) >>> longest_subsequence([9, 8, 7, 6, 5, 7])
[8] [5, 7]
>>> longest_subsequence([1, 1, 1]) >>> longest_subsequence([1, 1, 1])
[1, 1, 1] [1, 1, 1]
>>> longest_subsequence([]) >>> longest_subsequence([])
@ -44,7 +46,7 @@ def longest_subsequence(array: list[int]) -> list[int]: # This function is recu
while not is_found and i < array_length: while not is_found and i < array_length:
if array[i] < pivot: if array[i] < pivot:
is_found = True is_found = True
temp_array = [element for element in array[i:] if element >= array[i]] temp_array = array[i:]
temp_array = longest_subsequence(temp_array) temp_array = longest_subsequence(temp_array)
if len(temp_array) > len(longest_subseq): if len(temp_array) > len(longest_subseq):
longest_subseq = temp_array longest_subseq = temp_array