-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathmyRecursion.py
More file actions
79 lines (65 loc) · 1.36 KB
/
Copy pathmyRecursion.py
File metadata and controls
79 lines (65 loc) · 1.36 KB
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
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
# -*-coding: utf-8 -*-
# Author:
import math
'''
1. 利用递归的思想将整数转换成任意进制表示的字符串形式
'''
def to_str(n, base):
convert_string = "0123456789ABCDEF"
if n < base:
return convert_string[n]
else:
return to_str(n//base, base) + convert_string[n % base]
print(to_str(1024, 2))
'''
2. 利用递归的思想将字符串反向输出，
'''
def myReverse(items):
if len(items) < 1:
return items
else:
return myReverse(items[1:]) + items[0]
print(myReverse('asdfghk'))
'''
3. 判断是否为回文
'''
def func(string):
if len(string) < 2:
return True
if string[0] != string[-1]:
return False
else:
return func(string[1:-1])
print(func('assa'))
# 更为简洁的方法：
def func2(string):
return s == s[::-1]
print(func('sdsdssdsds'))
"""
4. 用递归实现斐波那契数列
"""
def fib_recur(n):
if n == 0 or n == 1:
return n
else:
return fib_recur(n-1) + fib_recur(n-2)
print(fib_recur(9))
"""
5. 递归计算阶乘
"""
def f(num):
if num == 0:
return 1
else:
return num * f(num - 1)
print(f(4))
"""
6. 递归求和
"""
def list_sum(num):
if len(num) == 1:
return num[0]
else:
return num[0] + list_sum(num[1:])
print("Recursion: ")
print(list_sum([i for i in range(10)]))