FazBrowse GitHub Viewer | Trending |
URL:
| Home
Tools: [Download Repo ZIP]   [Original HTTPS Page]

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

 
 

Latest commit

 

History

5 Commits

Folders and files

NameName
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

0 stars

Watchers

0 watching

Forks

Releases

Packages

Contributors

Languages


Back | FazBrowse Home | New Git URL