forked from flatpickles/Python-LCS
-
Notifications
You must be signed in to change notification settings - Fork 0
aopusd/Python-LCS
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
Python LCS A relatively simple Python script to find the longest common subsequence(s) of two lists of integers. For more information on the problem: http://en.wikipedia.org/wiki/Longest_common_subsequence_problem To use: store two lists of comma-separated integers in "lists.txt", separated by a line break. A lists.txt file is checked into the repo, populated with randomly generated lists of 100 integers as an example.
About
Solves the longest common subsequence problem in Python
Resources
Stars
Watchers
Forks
Releases
No releases published
Packages 0
No packages published
Languages
- Python 100.0%