From e674b457aa9a8912365f1ac52a1eaf4e3d386ddc Mon Sep 17 00:00:00 2001
From: Abigail <abigail@abigail.be>
Date: Tue, 4 May 2021 12:04:46 +0200
Subject: Python solution for week 111, part 2

---
 challenge-111/abigail/python/ch-2.py | 35 +++++++++++++++++++++++++++++++++++
 1 file changed, 35 insertions(+)
 create mode 100644 challenge-111/abigail/python/ch-2.py

(limited to 'challenge-111/abigail/python/ch-2.py')

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)
-- 
cgit