On 13/11/11 03:29, Ken G. wrote:
I checked the above website and I was linked to a foreign political
blog. The correct link is: tldp.org/ for The Linux Documentation Project.
Oops, sorry about that.
Amazing the difference a single letter makes! :-)
--
Alan G
Author of the Learn to Program
On Sun, Nov 13, 2011 at 12:40 AM, Andreas Perstinger
andreas.perstin...@gmx.net wrote:
On 2011-11-12 16:24, lina wrote:
Thanks, ^_^, now better.
No, I'm afraid you are still not understanding.
I checked, the sublist (list) here can't be as a key of the results
(dict).
result isn't a
On 11/13/2011 08:06 AM, lina wrote:
SNIP
Finally, if I am not wrong again, I feel I am kinda of starting
figuring out what's going on. Why it's None.
The main mistake here I use result = result.append(something)
the =
I checked the print(id(result)) and print(id(result.append()),
For the
On 2011-11-11 14:44, lina wrote:
You are right, I did not think of this parts before. and actually the
initiative wish was to find possible paths, I mean, possible
substrings, all possible substrings. not the longest one, but at
least bigger than 3.
I had some time today and since you have
On 2011-11-11 16:53, Jerry Hill wrote:
There's nothing wrong with writing your own code to find the longest common
substring, but are you aware that python has a module in the standard
library that already does this? In the difflib module, the SequenceMatcher
class can compare two sequences and
On Mon, Nov 14, 2011 at 6:28 AM, Andreas Perstinger
andreas.perstin...@gmx.net wrote:
On 2011-11-11 14:44, lina wrote:
You are right, I did not think of this parts before. and actually the
initiative wish was to find possible paths, I mean, possible
substrings, all possible substrings. not
On Mon, Nov 14, 2011 at 11:56 AM, lina lina.lastn...@gmail.com wrote:
On Mon, Nov 14, 2011 at 6:28 AM, Andreas Perstinger
andreas.perstin...@gmx.net wrote:
On 2011-11-11 14:44, lina wrote:
You are right, I did not think of this parts before. and actually the
initiative wish was to find
