10

JavaProgrammerLB · JavaProgrammerLB · commit 2ce9ce16b362 · 2017-11-19T15:22:21.000+08:00
diff --git a/10.py b/10.py
@@ -0,0 +1,26 @@
+a = [1]
+
+# calculate 30 values
+for i in range(1, 31):
+    # a[i] base
+    base = str(a[i - 1])
+    base_len = len(base)
+    result = "0"
+    j = 0
+    count = 1
+    while j + 1 < base_len:
+        if base[j + 1] == base[j]:
+            count += 1
+            j += 1
+        else:
+            result += str(count)
+            result += str(base[j])
+            j += 1
+            count = 1
+    if j + 1 == base_len:
+        result += str(count)
+        result += str(base[j])
+    a.append(int(result))
+
+print(a)
+print(len(str(a[30])))
diff --git a/README.md b/README.md
@@ -1,6 +1,20 @@
 # pythonchallenge
 Solve Problems in http://www.pythonchallenge.com
 
+#### 10
+result: http://www.pythonchallenge.com/pc/return/5808.html
+
+with pycharm IDE, I can debug the code easier.
+
+the method of find rule of **a** is:look at **a[i - 1]**, do count    
+1  
+the next is one 1: 11  
+the next is two 1: 21  
+the next is one 2 one 1: 1211  
+the next is one 1 one 2 two 2: 111221  
+the next is three 1 two 2 one 1: 312211  
+
+
 #### 9
 result:http://www.pythonchallenge.com/pc/return/bull.html
 
