Given a string, find the length of the longest substring without repeating characters.
Example 1:
Input: “abcabcbb”
Output: 3
Explanation: The answer is “abc”, with the length of 3.
Example 2:Input: “bbbbb”
Output: 1
Explanation: The answer is “b”, with the length of 1.
Example 3:Input: “pwwkew”
Output: 3
Explanation: The answer is “wke”, with the length of 3.
Note that the answer must be a substring, “pwke” is a subsequence and not a substring.
在剑指offer上也看过一道类似的题,也是找出最长不含重复字符的字符串长度,但是字符只包含‘a’~’z’,剑指offer的解题思路说利用了动态规划,今天想看看LeetCode上的大神是怎么做的,发现其实跟书里的解题方式差不多。
这里给出LeetCode上的大神的答案;
这篇博客则讲解了其思路:
string内的每个字符使用ASCII码表示,因此用一个大小为256的数组就能表示其所有字符。遍历字符串时,使用该数组来记录每个字符最后出现的位置,同时记录一个新的不包含重复字符串的子字符串的起点start,而记录一个maxLength用于表示题目所求:index-start表示新的不包含重复字符串的子字符串的长度
maxLength=max(maxLength, 当前遍历到的字符的下标 index - start);
代码:
class Solution {
public:
int lengthOfLongestSubstring(string s) {
vector<int> dictionary(256, -1);
int start = -1, maxLength = 0;
for (auto i = 0; i < s.length(); i++) {
if (dictionary[s[i]] > start) {
start = dictionary[s[i]];
}
dictionary[s[i]] = i;
maxLength = max(maxLength, i-start);
}
return maxLength;
}
};
而剑指offer中因为字符串中只有’a’~’z’,因此数组大小只需设为26;剑指offer给出的思路如下:设f(i)表示第i个字符串为结尾的不包含重复字符串的子字符串的最长长度,那么:
如果第i个字符之前没有出现过,那么f(i) = f(i-1)+1;
如果第i个字符已经出现过:
- 当第i个字符和它上次出现的位置的距离d,小于或等于f(i-1),即上次第i个字符出现在f(i-1)对应的所求解字符串中,因此f(i) = d;
- 当d 大于f(i-1)时,说明第i个字符串出现在f(i-1)对应的解之前,因此仍然有f(i) = f(i-1) + 1。
代码:
int lengthOfLongestSubstring(string s) {
vector<int> pos(26, -1);
int curLength = 0, maxLength = 0;
for (auto i = 0; i < s.length(); i++) {
int preIndex = pos[s[i]-'a'];
if (preIndex < 0 || i - preIndex > curLength) {
curLength++;
start = dictionary[s[i]-'a'];
} else {
maxLength = max(maxLength, curLength);
curLength = i - preIndex;
}
dictionary[s[i]-'a'] = i;
}
maxLength = max(maxLength, curLength);
return maxLength;
}
虽然理解起来解题思路不太一样,但是是相通的。