-
Notifications
You must be signed in to change notification settings - Fork 0
/
recursion.py
46 lines (30 loc) · 870 Bytes
/
recursion.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Wed Jul 21 11:16:09 2021
@author: riya
"""
# def isPalindrome(s):
# def toChars(s):
# s = s.lower()
# ans = ''
# for c in s:
# if c in 'abcdefghijklmnopqrstuvwxyz':
# ans = ans + c
# return ans
# def isPal(s):
# if len(s) <= 1:
# return True
# else:
# return s[0] == s[-1] and isPal(s[1: -1])
# return isPal(toChars(s))
# print(isPalindrome('Able was I, ere I saw Elba'))
def printMove(fr, to):
print('move from ' + str(fr) + ' to ' + str(to))
def Towers(n, fr, to, spare):
if n == 1:
printMove(fr, to)
else:
Towers(n-1, fr, spare, to)
Towers(1, fr, to, spare)
Towers(n-1, spare, to, fr)