algorithm/Python
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/Python.git synced 2025-12-19 02:07:27 +08:00
Code Issues Packages Projects Releases Wiki Activity
1,302 Commits 8 Branches 0 Tags
ad2db80f8aeba7fe407eccd69327cfb3bdfaacd2
Commit Graph

8 Commits

Author SHA1 Message Date
John Law
a9d5378ce2 Doctest and typing for longest_increasing_subsequence.py (#1526) 
* Update longest_increasing_subsequence.py

* Update longest_increasing_subsequence.py

* Format longest_increasing_subsequence.py to PEP8

* Update longest_increasing_subsequence.py
 2019-11-05 02:06:16 +08:00
William Zhang
9eac17a408 psf/black code formatting (#1277) 2019-10-05 10:14:13 +05:00
Christian Clauss
47a9ea2b0b Simplify code by dropping support for legacy Python (#1143) 
* Simplify code by dropping support for legacy Python

* sort() --> sorted()
 2019-08-19 15:37:49 +02:00
cclauss
4e06949072 Modernize Python 2 code to get ready for Python 3 2017-11-25 10:23:50 +01:00
Mehdi ALAOUI
08cbd113a4 Code optimized and complexity decreased 2017-04-10 13:49:01 +01:00
Mehdi ALAOUI
e01cf425bd Comments reviewed 2017-04-07 03:27:15 +01:00
Mehdi ALAOUI
628f184af5 The program returns now the longest increasing subsequence instead of returning only the length. Code optimized and well commented 2017-04-07 03:19:02 +01:00
dhruvsaini
436edf3a88 Create longest_increasing_subsequence.py 
The Longest Increasing Subsequence (LIS) problem is to find the length of the longest subsequence of a given sequence such that all elements of the subsequence are sorted in increasing order. For example, the length of LIS for {10, 22, 9, 33, 21, 50, 41, 60, 80} is 6
 2017-01-03 16:54:38 +05:30