Python suanfa

01汉诺塔问题（递归）.py

@@ -0,0 +1,8 @@
+def hanoi(n, a, b, c):
+    if n>0:
+        hanoi(n-1, a, c, b)
+        print("从 %s 移动到 %s " % (a, c))
+        hanoi(n-1, b, a, c)
+
+
+hanoi(2, "A", "B", "C")

README.md

@@ -0,0 +1 @@
+python learn

deque模块（双向队列）.py

@@ -0,0 +1,22 @@
+from collections import deque
+# q = deque()
+# q.append() # 队尾进队
+# q.popleft() # 队首出队
+#
+# # 双向队列
+# q.appendleft() # 队首进队
+# q.pop() # 队尾出队
+
+# def tail(n):
+#     with open('text.txt', 'r') as f:
+#         q = deque(f, n)
+#         return q
+#
+# for line in tail(5):
+#     print(line, end="")
+
+q1 = deque(maxlen=2)  # 从右边添加，满了从左边剔除
+q1.append(1)
+q1.append(2)
+q1.append(3)
+print(q1)