class Solution
{
public:
int lengthOfLongestSubstring(string s)
{
int i, j, k, len, preLen = 0, maxLen = 0;
map<char, int> m;
map<char, int> :: iterator it;
for(i = 0; i < s.size(); i++)
{
len = 0;
k = i + preLen - 1 < 0 ? 0 : i + preLen - 1;
for(j = k; j < s.size(); j++)
{
m[s[j]]++;
if(m[s[j]] > 1)
{
if(len == 0 && s[j] != s[i - 1])
preLen -= 1;
break;
}
if(j == k && j > 0)
len += preLen;
else if(j > k || j == 0)
len++;
}
maxLen = max(len, maxLen);
if(len)
preLen = len;
m[s[i]] = 0;
}
return maxLen;
}
};
leetcode:Longest Substring Without Repeating Characters
發表評論
所有評論
還沒有人評論,想成為第一個評論的人麼? 請在上方評論欄輸入並且點擊發布.