想了个笨方法,字符串的每个字符都作为开头遍历一遍,看最长是多少。如果这些字符没有重复的,时间复杂度最差,是O(n^2);如果最好,是O(n)。
class Solution {
public:
int lengthOfLongestSubstring(string s) {
int l = s.size();
int max = 0, len = 0;
for (int i = 0; i < l; ++i)
{
int found[256] = {0};
for (int j = i; j < l; j++)
{
if(found[s[j]]) {
if(len > max)max = len;
break;
}
found[s[j]] = 1; len++;
//cout << i << " " << j << " len = " << len << endl;
}
if(len > max)max = len;
len = 0;
}
return max;
}
};
其实,我觉得比较好的方法在这道题的讨论区里,有一个9行c++代码的解法,算法时间复杂度只有O(n),代码很简练有效,以我的水平是肯定想不到哒,这里顺便贴出来
int lengthOfLongestSubstring(string s) {
vector<int> dict(256, -1);
int maxLen = 0, start = -1;
for (int i = 0; i != s.length(); i++) {
if (dict[s[i]] > start)
start = dict[s[i]];
dict[s[i]] = i;
maxLen = max(maxLen, i - start);
}
return maxLen;
}