5 Commits

Author	SHA1	Message	Date
Rwithik Manoj	d4151bd516	Fix possible error in longest_common_subsequence.py (#1163) ... The comparison at line 53 was not checking if (j > 0).	2019-08-31 13:40:50 +02: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
Maxwell Aladago	32aa7ff081	ENH: refactored longest common subsequence, also fixed a bug with the sequence returned (#1142) ... * function for the knapsack problem which returns one of the optimal subsets * function for the knapsack problem which returns one of the optimal subsets * function for the knapsack problem which returns one of the optimal subsets * function for the knapsack problem which returns one of the optimal subsets * function for the knapsack problem which returns one of the optimal subsets * some pep8 cleanup too * ENH: refactored longest common subsequence, also fixed a bug with the sequence returned * renamed function	2019-08-19 09:40:36 +02:00
cclauss	4e06949072	Modernize Python 2 code to get ready for Python 3	2017-11-25 10:23:50 +01:00
Erdenezul	3c4c7eb2aa	refactor longest common subsequence problem	2017-11-01 15:04:55 +08:00