more_AFIB_list = []
more_AFIB_index = [0]*(sumIndex[len(sumIndex)-1]+1)
for i in range(0,len(sumIndex)):
more_AFIB_index[sumIndex[i]] += 1
for i in range(1,len(more_AFIB_index)):
if(more_AFIB_index[i] > 1):
# print(i)
more_AFIB_list.append(i)
print(more_AFIB_list)
print(len(more_AFIB_list))
空间复杂度太高,哈希表可以降低空间复杂度,可惜不会,再议