GitHub - zhihuashan/Python-LCS: Solves the longest common subsequence problem in Python

zhihuashan / Python-LCS Public

forked from flatpickles/Python-LCS

Notifications You must be signed in to change notification settings
Fork 0
Star 0

Solves the longest common subsequence problem in Python

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 6 Commits
.gitignore		.gitignore
lcs.py		lcs.py
lists.txt		lists.txt
readme.txt		readme.txt

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.