leetcode 题目:Longest Substring Without Repeating Characters
int lengthOfLongestSubstring(string s) {
vector<int> dict(256, -1);int maxLen = 0, start = -1;
for (int i = 0; i != s.length(); i++) {
cout << "the s[i] " << s[i] << endl;
cout << dict[s[i]] << endl;
if (dict[s[i]] > start)
start = dict[s[i]];
dict[s[i]] = i;
maxLen = max(maxLen, i - start);
}
return maxLen;
}
这种解答方式中就将dict当作字典来使用,键是字符,值是字符的索引。