哔哩哔哩笔试（策略算法岗）

def cheng(a): temp = 1 for i in a: temp *= int(i) return temp def jia(b): return sum(b) def jian(c): total = int(c[0]) for i in c[1:]: total -= int(i) return total while 1: string = input() if string == 'END': break res = [] final = [] jia_list = string.split('+') for item in jia_list: jian_list = item.split('-') res.append(jian_list) for j in res: if len(j) == 1: final.append(cheng(j[0].split('*'))) else: for k, v in enumerate(j): j[k] = cheng(v.split('*')) final.append(jian(j)) print(jia(final)) 唯一AC的一道题。。写的不美观，将就着看吧

没收到笔试通知😱

投机取巧的做法，使用Python3中eval函数： Input = [] s = input() while s != 'END': Input.append(s) s = input() for i in range(len(Input)): ret = eval(Input[i]) print(ret)

def solve(s):     stack = []     sign = ''     for i in range(len(s)):         if(s[i].isdigit()):             intv = int(s[i])             if(sign == '') or (sign == '+'):                 stack.append(intv)             elif(sign == '-'):                 stack.append(-intv)             elif(sign == '*'):                 temp = stack.pop()                 stack.append(temp*intv)         else:             sign = s[i]     print(sum(stack)) while(True):     string = input()     if string == 'END':         break     solve(string) 我用栈的思想，为什么只有75%呢，楼主求解啊