本文探讨了在遇到无法直接解决的问题时，如何通过转换问题性质，将其变为零中心问题来寻找解决方案。详细介绍了当假设变量等于某个特定值时，如何通过调整使问题简化，并利用映射跟踪求和，以更新当前最大值。
Error:
cannot solve it. Change 0 to -1, so that it become a zero center problem.
Assume s[i] = x, and s[j] = x, so that: s[i] + n[i + 1] … + n[j] =
s[j] i.e. n[i + 1] + … + n[j] = 0Also, if s[j] == 0, we can treat it as corner case.
Base on that, we build a map to keep track of sum, if that sum appear before or current sum = 0, compare it to our current max.
扫一扫
268
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
