LeetCode_3 无重复字符的最长子串 longest-substring-without-repeating-characters

滑动窗口，简单题code int lengthOfLongestSubstring(string s) { unordered_map<char, int> mymap; int pre = 0; int maxx = 0; for(int i = 0; i < s.size(); i++){ if(mymap.find(s[i]) == mymap

>>阅读原文<<