[leetcode] 3. Longest Substring Without Repeating Characters

题目链接：https://leetcode.com/problems/longest-substring-without-repeating-characters/

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for “abcabcbb” is “abc”, which the length is 3. For “bbbbb” the longest substring is “b”, with the length of 1.

思路

经典的字符串处理问题

借助一个hash数组，维护一个不包含重复字符串的窗口，使用左右指针left，right滑动窗口大小。左右至臻的滑动规则如下：

1. 首先右指针right向右滑动，直到遇到一个和窗口中重复的字符。右指针在滑动过程中更新最大不重复子串的长度。

2. 此时向右移动左指针，使得左指针移动到重复字符之后去，同时左指针向右移动的过程中更新hash表的字母计数。再重复1的操作直到遍历完字符，即可找到最大子串长度。

   时间复杂度O(n)，空间复杂度O(n)。

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        if(s.size() == 0) return 0;
        int left = 0,Right = 0;
        unordered_map<char,bool> hash;
        for(int i = 0;i < s.size();i++){
            while(hash.count(s[i])) hash.erase(s[left++]);
            hash[s[i]] = true;
            Right = max(Right,(int) hash.size());
        }
        return Right;
    }
};