Groups | Search | Server Info | Keyboard shortcuts | Login | Register [http] [https] [nntp] [nntps]
Groups > comp.lang.python > #80291
| Newsgroups | comp.lang.python |
|---|---|
| Date | 2014-11-05 11:29 -0800 |
| References | <50a7df31-ee6c-45f5-9dd8-6ac895ec46cf@googlegroups.com> <6ee4fb35-da11-49e3-b982-cd45d0b898e8@googlegroups.com> |
| Message-ID | <ec145ccb-52d3-4acc-9dc1-7dd8a0c0f8f5@googlegroups.com> (permalink) |
| Subject | Re: I need algorithm for my task |
| From | wxjmfauth@gmail.com |
Le mercredi 5 novembre 2014 20:08:03 UTC+1, wxjm...@gmail.com a écrit : > Le mercredi 5 novembre 2014 12:58:44 UTC+1, lordv...@gmail.com a écrit : > > I have line 'pythonpythonpyth'. How do I know which word is the foundation line?. > > Other examples: > > "pythonpythonpyth" is python > > "DOLORIUMD" is DOLORIUM > > "HELLOLHELLO" is HELLOL > > "thewordword" is thewordword > > > > I need to know whether the word in the text is repeated and get it. This will be the key. > > From your examples: impossible, unsolvable. [*] > > [*] unless using an "external" list of words. Mea culpa. Sorry, I was wrong. (I "missread" one example).
Back to comp.lang.python | Previous | Next — Previous in thread | Next in thread | Find similar | Unroll thread
I need algorithm for my task lordvital21@gmail.com - 2014-11-05 03:58 -0800
Re: I need algorithm for my task Chris Angelico <rosuav@gmail.com> - 2014-11-05 23:29 +1100
Re: I need algorithm for my task Darren Chen <ccylily1314@gmail.com> - 2014-11-06 17:42 -0800
Re: I need algorithm for my task Peter Otten <__peter__@web.de> - 2014-11-05 13:36 +0100
Re: I need algorithm for my task Denis McMahon <denismfmcmahon@gmail.com> - 2014-11-05 15:19 +0000
Re: I need algorithm for my task MRAB <python@mrabarnett.plus.com> - 2014-11-05 17:53 +0000
Re: I need algorithm for my task wxjmfauth@gmail.com - 2014-11-05 11:07 -0800
Re: I need algorithm for my task wxjmfauth@gmail.com - 2014-11-05 11:29 -0800
Re: I need algorithm for my task wxjmfauth@gmail.com - 2014-11-05 22:31 -0800
csiph-web