本文深入探讨了滑动窗口算法的实现细节，强调了在更新s_map时对左边界和右边界元素的正确处理，避免常见的错误。特别指出，在增加s_map时，仅当s_map[right]等于t_map[right]时才增加计数变量，确保效率。
Sliding windows, actually it is not a hard problem.
Error:
- need to take care of s[left] and s[right] and left and right, it is very easy to use wrong one when find or other situation.
- When increase the s_map, we only need to increase our counting variable once s_map[right] == t_map[right], so that when s_map[right] increase, we do not need to increase again,
- When decrease the s_map, only decrease when s_map[left] < t_map[left]
扫一扫
81
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
