Bob -算法題-加減乘除-split/count-return

# 計算器
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'))