01recur_fac(n)递归函数
def recur_fac(n):
if n == 3: #当n为3时结束递归
return 3
return n * recur_fac(n-1) #进行函数递归
print("4的阶乘:",recur_fac(4))
#4的阶乘 4*(4-1)
4的阶乘: 12
02斐波那契数列
def fibonacci_seq(n):
if n == 1 or n == 2:
return 1
else:
return fibonacci_seq(n-1)+fibonacci_seq(n-2)
nums = []
for i in range(1,10):
nums.append(fibonacci_seq(i))
# append() 方法向列表的尾部添加一个新的元素
print(nums)
[1, 1, 2, 3, 5, 8, 13, 21, 34]
03索引
#索引
s = ["hha","rea","yue"]
print("读取第三个元素:",s[2])
print("读取第一个元素:",s[0])
print("读取最后一个元素:",s[-1])
读取第三个元素: yue
读取第一个元素: hha
读取最后一个元素: yue
04
#切片
s = ["hha","rea","yue","111","222","333","344"]
print("获取第3-5个元素:",s[2:5])
print("读取元素:",s[1:6:2])
#序列取反
print("序列取反:",s[::-1])
获取第3-5个元素: ['yue', '111', '222']
读取元素: ['rea', '111', '333']
序列取反: ['344', '333', '222', '111', 'yue', 'rea', 'hha']
欢迎指正!