Clear questions and runnable code get the best and fastest answer |
|
PerlMonks |
Re^2: Longest Common Subsequenceby Limbic~Region (Chancellor) |
on May 11, 2006 at 23:22 UTC ( [id://548868]=note: print w/replies, xml ) | Need Help?? |
diotalevi,
I hate it when things seem clear in my head and then someone shows how painfully obvious that it wasn't clear. The letter D does not appear in all strings. In my challenge, I took advantage of the fact that every string contained the exact same 36 characters to take some shortcuts. All I meant by a general solution is one that doesn't have restrictions on the presence of every character in any one string appearing in every other string. Obviously any character that isn't present in all strings can't be part of the LCS but there is no limit as to how many can be missing. Cheers - L~R
In Section
Meditations
|
|