[triangle-zpug] how to match strings in python

Joseph Mack NA3T jmack at wm7d.net
Thu Apr 2 17:04:56 UTC 2009

On Thu, 2 Apr 2009, Stephan Altmueller wrote:

> But if I understand the initial question correctly you 
> want to find the longest common substring that two string 
> share, correct ?

yes, but the comparison has to start at element 0.

> That's a well defined computer science problem:
> http://en.wikibooks.org/wiki/Algorithm_implementation/Strings/Longest_common_substring#Python


I gave up looking when I couldn't find a way of indexing 
into a string.

Joseph Mack NA3T EME(B,D), FM05lw North Carolina
jmack (at) wm7d (dot) net - azimuthal equidistant map
generator at http://www.wm7d.net/azproj.shtml
Homepage http://www.austintek.com/ It's GNU/Linux!

More information about the triangle-zpug mailing list