Python复习

s = input("请输入一个字符串：")
l1 = list()
for i in s:
    l1.append(ord(i))
print(l1)


def count_words_with_e(s):
    words_with_e = []
    words = s.split()  # 将字符串拆分成单词列表
    for word in words:
        if 'e' in word:  # 判断单词中是否包含字母 e
            words_with_e.append(word)  # 如果包含，则将该单词添加到列表中
    return words_with_e
s = "the quick brown fox jumps over the lazy dog"
result = count_words_with_e(s)
print(result)

#递归方式
def fact(n):
    if n==0:
        return 1
    return n*fact(n-1)
n=int(input('请输入整数n(n>0)：'))
print(str(n)+'!='+ str(fact(n)))


#非递归方式
def fact(n):
    t=1
    for i in range(1,n+1):
        t*=i
    return t
n=int(input('请输入整数n(n>0)：'))
print(str(n)+'!='+ str(fact(n)))


print('-----------------------------递归方式---------------------------------------')
#递归方式
def fib(n):
    if n==1 or n==2:
        return 1
    return fib(n-1)+fib(n-2)
for i in range(1,21):
    print(str(fib(i)).rjust(5,' '),end=' ')
    if i%10==0:
        print()

print('-----------------------------非递归方式---------------------------------------')
#非递归方式
def fib(n):
    if n==1 or n==2:
        return 1
    n1=n2=1
    for i in range(3,n+1):
        n3=n1+n2
        n1=n2
        n2=n3
    return n3
for i in range(1,21):
    print(str(fib(i)).rjust(5,' '),end=' ')
    if i%10==0:
        print()