FilesExpand file tree

 master

/

Recursion.py

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

38 lines (31 loc) · 927 Bytes

 master

/

Recursion.py

Copy path

Top

File metadata and controls

• Code
• Blame

38 lines (31 loc) · 927 Bytes

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

# 递归求和

def listSum(numlist):

if len(numlist) == 1:

return numlist[0]

else:

return numlist[0] + listSum(numlist[1:])

print(listSum([1, 2, 3, 4, 5, 6, 7]))

# 递归求阶乘

def listFactorial(num):

if num <= 1:

return 1

else:

return num * listFactorial(num-1)

print(listFactorial(10))

# 递归实现进制转换:

def toStr(n,base):

convertString = "0123456789ABCDEF"

if n < base:

return convertString[n]

else:

return toStr(n//base, base) + convertString[n%base]

print(toStr(1453, 16))

# 递归实现Hanoi塔

def Hanoi(fromPole, withPole, toPole, diskNum):

if diskNum <= 1:

print("moving disk from %s to %s" % (fromPole, toPole))

else:

Hanoi(fromPole, toPole, withPole, diskNum-1)

print("moving disk from %s to %s" % (fromPole, toPole))

Hanoi(withPole, fromPole, toPole, diskNum-1)

Hanoi('A', 'B', 'C', 3)