# 计算器
def putong_yunsuan_2(s):
if '+' in s:
x = s.split("+")
return int(x[0])+int(x[1])
elif '-' in s:
x = s.split("-")
return int(x[0])-int(x[1])
elif '*' in s:
x = s.split("*")
return int(x[0])*int(x[1])
elif '/' in s:
x = s.split("/")
return int(x[0])/int(x[1])
num = putong_yunsuan_2("8/9")
print(num)
# 加减乘除运算
# 写成函数
# 算法题,参加全国编程竞赛,国际编程竞赛,去腾讯阿里工作
# 大学生
def shenqi_zifuchuan(s, k):
print(s[k:len(s):1] + s[0:k:1])
return s[k:len(s):1] + s[0:k:1]
s = 'abcdefghijklmnopqrstuvwxyz'
k = 7
shenqi_zifuchuan(s, k)
def suanf(J,S):
num = 0
for i in range(len(J)):
num = num + S.count(J[i])
return num
J = "z",
S = "ZZ"
print(suanf(J,S))
s = 'aaaaaaabbbbbbb'
# count 数数
print(s.count('a'))
Bob -算法题-加减乘除-split/count-return
最新推荐文章于 2022-06-16 14:27:14 发布