Commit e0970b3f by BellCodeEditor

auto save

parent 9c4fa246
Showing with 45 additions and 10 deletions
# 假期到了,诺依想出去玩,但不知道有没有飞机直达那里, # # # 1,排序方式,冒泡,插入,选择,
# 悟空做了个小程序帮助诺依,然而代码出现了3处错误。 # # # 2,递归{
# 请你找出来,并运行~ # # # 递归:
city = ['纽约','华盛顿','桃源岛','洛杉矶','芝加哥',旧金山] # # # 地推:
raise=input('你想去哪里啊?') # # # 斐波那契额数列
if raise in city # # # 1关系,2出口
print('可以乘坐飞机通往'+raise) # # # def a(n):
else: # # # if n==1 or n==2:
print('没有'+raise+'这座城市') # # # return 1
\ No newline at end of file # # # return a(n-1)+a(n-2)
# # # print(a(10))
# # # def a(n):
# # # if n==1:
# # # return 1
# # # return a(n-1)+n
# # # print(a(100))
# # num = int(input("请输入一个数字: "))
# # # 质数大于 1
# # if num > 1:
# # # 查看因子
# # for i in range(2, num):
# # if (num % i) == 0:
# # print(num, "不是质数")
# # print(i, "乘于", num // i, "是", num)
# # break
# # else:
# # print(num, "是质数")
# # # 如果输入的数字小于或等于 1,不是质数
# # else:
# # print(num, "不是质数")
# a = [1,2,3,4,5,6,7,8,9,10]
# def is_odd(n):
# return n % 2 == 0
# print(list(filter(is_odd(),a)))
b1=[1,2,3]
b2=[2,3,4]
b3 = [val for val in b1 if val in b2]
print (b3)
\ No newline at end of file
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or sign in to comment