写一个代码：Given a string s, find the length of the longest substring without repeating characters....

答案：int lengthOfLongestSubstring(string s) { int len = 0; int start = 0; int end = 0; unordered_set seen; while (end < s.length()) { if (seen.find(s[end]) == seen.end()) { seen.insert(s[end]); end++; len = max(len, end - start);