diff options
| -rw-r--r-- | challenge-111/abigail/README.md | 1 | ||||
| -rw-r--r-- | challenge-111/abigail/python/ch-2.py | 35 |
2 files changed, 36 insertions, 0 deletions
diff --git a/challenge-111/abigail/README.md b/challenge-111/abigail/README.md index 1b8e0cd4dd..eb38f91e14 100644 --- a/challenge-111/abigail/README.md +++ b/challenge-111/abigail/README.md @@ -56,6 +56,7 @@ to standard output. In case of ties, we print the first one found. * [Lua](lua/ch-2.lua) * [Node.js](node/ch-2.js) * [Perl](perl/ch-2.pl) +* [Python](python/ch-2.py) ### Blog diff --git a/challenge-111/abigail/python/ch-2.py b/challenge-111/abigail/python/ch-2.py new file mode 100644 index 0000000000..ce79d6b393 --- /dev/null +++ b/challenge-111/abigail/python/ch-2.py @@ -0,0 +1,35 @@ +#!/opt/local/bin/python + +# +# See ../README.md +# + +# +# Run as: python ch-2.py < input-file +# + +import fileinput +import string +import re + + +# +# Create a pattern which matches words with their characters in lexical order. +# +pat = "^" +for x in list (string . ascii_lowercase): + pat = pat + x + "*" +pat += "$" + + +# +# Match strings with their characters in lexical order, and remember +# the longest of them. +# +longest = "" +for line in fileinput . input (): + line = line . strip () + if re . match (pat, line . lower ()) and len (line) > len (longest): + longest = line + +print (longest) |