Create tower_of_hanoi.py

yingl · web-flow · commit 3a3d883469a5 · 2018-04-08T22:13:17.000+08:00
diff --git a/tower_of_hanoi.py b/tower_of_hanoi.py
@@ -0,0 +1,22 @@
+class Solution:
+    """
+    @param n: the number of disks
+    @return: the order of moves
+    """
+    def towerOfHanoi(self, n):
+        # write your code here
+        ret = []
+        if n > 0:
+            Solution.move(n, 'A', 'C', 'B', ret)
+        return ret
+        
+    @staticmethod
+    def move(n, source, target, by, ret):
+        if n == 1:
+            ret.append('from %s to %s' % (source, target))
+        else:
+            Solution.move(n - 1, source, by, target, ret)
+            ret.append('from %s to %s' % (source, target))
+            Solution.move(n - 1, by, target, source, ret)
+
+# medium: http://lintcode.com/zh-cn/problem/tower-of-hanoi/
