最长无重复子串（滑动窗口）

https://leetcode.cn/problems/longest-substring-without-repeating-characters/

#include
#include
#include
using namespace std;
int longest_norepeated_character_substr(string str){
    int maxlen(1);
    unordered_set sets;
    sets.insert(str[0]);
    for(size_t istart(0),iend(0);istartmaxlen)
            maxlen=iend-istart+1;
        sets.erase(str[istart]);
    }
    return maxlen;
}
int main(int argc,char *argv[]){
    cout<