360笔试，第二道一直73%
下午360笔试还是挺友好的，感觉不难，各位大佬看看我的第二道出了什么问题
第一道，hash求出现最多的字符AC
def max_count(x):
dic = {}
for i in x:
dic[i] = dic.get(i,0) +1
return max(dic.values())
if __name__ == '__main__':
n = input()
print(max_count(n)) def sport(N,D): res = [] for i in range(N): if dfs(N,D,i) != False: res.append(dfs(N,D,i)) return len(set(res)) def dfs(N,D,n): for i in D: if n+i>N: n = n-i if n<0: return False else: n = n+i return n if __name__ == '__main__': N,M = map(int,input().split()) D = [] for i in range(M): D.append(int(input())) print(sport(N-1,D))
第二道，dfs一直只是73%
def sport(N,D): res = 0 for i in range(N): if dfs(N,D,i) == True: res+=1 return max(max(D),res) def dfs(N,D,n): for i in D: if n+i>N: n = n-i if n<0: return False else: n = n+i return True if __name__ == '__main__': N,M = map(int,input().split()) D = [] for i in range(M): D.append(int(input())) print(sport(N-1,D))
查看9道真题和解析