Merge pull request #9355 from simongreen-net/master

Simon's solution to challenge 250

2 files changed, 40 insertions, 0 deletions

diff --git a/challenge-250/sgreen/python/ch-1.py b/challenge-250/sgreen/python/ch-1.py
new file mode 100755
index 0000000000..d907d03257
--- /dev/null
+++ b/challenge-250/sgreen/python/ch-1.py
@@ -0,0 +1,23 @@
+#!/usr/bin/env python3
+
+import sys
+
+
+def main(ints):
+    solution = -1
+
+    # Loop through each position
+    for idx in range(len(ints)):
+        # The index mod 10 is the value at this position
+        if idx % 10 == ints[idx]:
+            # We have the best solution, so no need to continue looping
+            solution = idx
+            break
+
+    print(solution)
+
+
+if __name__ == '__main__':
+    # Convert input into integers
+    array = [int(n) for n in sys.argv[1:]]
+    main(array)
diff --git a/challenge-250/sgreen/python/ch-2.py b/challenge-250/sgreen/python/ch-2.py
new file mode 100755
index 0000000000..9ee64eea3f
--- /dev/null
+++ b/challenge-250/sgreen/python/ch-2.py
@@ -0,0 +1,17 @@
+#!/usr/bin/env python3
+
+import re
+import sys
+
+
+def calculate_value(s):
+    '''Return the number if it looks like an integer else the length of string'''
+    return int(s) if re.search(r'^\d+$', s) else len(s)
+
+
+def main(values):
+    print(max(map(calculate_value, values)))
+
+
+if __name__ == '__main__':
+    main(sys.argv[1:])