Solutions for challenge #80.

2 files changed, 48 insertions, 0 deletions

diff --git a/challenge-080/roger-bell-west/python/ch-1.py b/challenge-080/roger-bell-west/python/ch-1.py
new file mode 100755
index 0000000000..482284d1f2
--- /dev/null
+++ b/challenge-080/roger-bell-west/python/ch-1.py
@@ -0,0 +1,23 @@
+#! /usr/bin/python3
+
+import unittest
+
+def spn(list):
+    r=frozenset(list)
+    m=1
+    while m in r:
+        m += 1
+    return m
+
+class TestSpn(unittest.TestCase):
+
+    def test_ex1(self):
+        self.assertEqual(spn((5,2,-2,0)),1,'example 1')
+
+    def test_ex2(self):
+        self.assertEqual(spn((1,8,-1)),2,'example 2')
+
+    def test_ex3(self):
+        self.assertEqual(spn((2,0,-1)),1,'example 3')
+
+unittest.main()
diff --git a/challenge-080/roger-bell-west/python/ch-2.py b/challenge-080/roger-bell-west/python/ch-2.py
new file mode 100755
index 0000000000..bccad43f27
--- /dev/null
+++ b/challenge-080/roger-bell-west/python/ch-2.py
@@ -0,0 +1,25 @@
+#! /usr/bin/python3
+
+import unittest
+
+def cc(list):
+    n=sorted(range(len(list)), key=lambda x: list[x])
+    k=[0] * len(list)
+    for i in n:
+        nr=[1]
+        if (i > 0 and list[i-1] < list[i]):
+            nr.append(k[i-1]+1)
+        if (i < len(list)-1 and list[i+1] < list[i]):
+            nr.append(k[i+1]+1)
+        k[i]=max(nr)
+    return sum(k)
+
+class TestCc(unittest.TestCase):
+
+    def test_ex1(self):
+        self.assertEqual(cc((1,2,2)),4,'example 1')
+
+    def test_ex2(self):
+        self.assertEqual(cc((1,4,3,2)),7,'example 2')
+
+unittest.main()