本文介绍了一种使用滑动窗口解决字符串中字符重复问题的方法。通过哈希映射存储当前窗口内的字符及其数量，判断映射是否有效。若有效，则移动头部并更新最大值；反之，尾部前移并丢弃元素，直至无重复字符。
Use sliding windows to solve the problem.
First, we use the hash map to store how many character and which character we store currently. Then judge our current hash map is valid or not. If valid, let the head move forward and compare to our current maximum, otherwise let our tail move forward and throw out the tail element at the mean time until our current hash map does not exist duplicate element.
It is straight forward, and the time complexity is O(n), and there are no edge case to handle. So that is it.
扫一扫
271
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
