最佳答案
定义:
P[i] = A[i+1] + A[i+2] + ... + A[n]
Q[i] = A[1] + ... + A[i-1]
然后,S[i] = P[i] + Q[i]
关于algorithm - 找到前缀和变化的 O(n) 解,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/32846398/
最佳答案
定义:
P[i] = A[i+1] + A[i+2] + ... + A[n]
Q[i] = A[1] + ... + A[i-1]
然后,S[i] = P[i] + Q[i]
关于algorithm - 找到前缀和变化的 O(n) 解,我们在Stack Overflow上找到一个类似的问题: https://stackoverflow.com/questions/32846398/