Simon's solution to challenge 215

2 files changed, 54 insertions, 0 deletions

diff --git a/challenge-215/sgreen/python/ch-1.py b/challenge-215/sgreen/python/ch-1.py
new file mode 100755
index 0000000000..b10b6e1547
--- /dev/null
+++ b/challenge-215/sgreen/python/ch-1.py
@@ -0,0 +1,27 @@
+#!/usr/bin/env python3
+
+import sys
+
+
+def main(words):
+    current_word = words.pop(0)
+    unsorted_words = 0
+
+    if any(word < current_word for word in words):
+        # If the first word is not the smallest, the whole list is unsorted
+        print(len(words)+1)
+        return
+
+    for word in words:
+        if word >= current_word:
+            # The next word is in order
+            current_word = word
+        else:
+            # The word is less than the current word
+            unsorted_words += 1
+
+    print(unsorted_words)
+
+
+if __name__ == '__main__':
+    main(sys.argv[1:])
diff --git a/challenge-215/sgreen/python/ch-2.py b/challenge-215/sgreen/python/ch-2.py
new file mode 100755
index 0000000000..9fc8a9a7e9
--- /dev/null
+++ b/challenge-215/sgreen/python/ch-2.py
@@ -0,0 +1,27 @@
+#!/usr/bin/env python
+
+import sys
+
+
+def main(array):
+    to_place = array.pop()
+
+    for i in range(1, len(array)-1):
+        # Are the number before the current one, the current one and the next one all zero?
+        if array[i-1] == 0 and array[i] == 0 and array[i+1] == 0:
+            # If so, we can put a one here
+            array[i] = 1
+            to_place -= 1
+            if to_place == 0:
+                # We have placed all the ones
+                print(1)
+                return
+
+    # There is no possible solution
+    print(0)
+
+
+if __name__ == '__main__':
+    # Turn the strings into integers
+    n = [int(i) for i in sys.argv[1:]]
+    main(n)