题目:
请从字符串中找出一个最长的不包含重复字符串的子字符串,计算该最长子字符串的长度。假设字符串中只包含‘a’~‘z’的字符。
例子:
例如,在字符串“arabcacfr”中,最长的不含重复字符的子字符串是“acfr”,长度为4。
链接:
剑指Offer(第2版):P236
LeetCode-3:Longest Substring Without Repeating Characters (最长无重复字符的子串) –medium
思路标签:
- 算法:动态规划
解答:
动态规划求解
- 定义问题:
- 如果第i个字符之前没有出现过,那么f(i) = f(i-1)+1;
- 如果第i个字符之前出现过,记第i个字符和它上出现在字符串中的位置的距离,记为d。如果d>f(i-1),那么仍然有f(i) = f(i-1)+1;如果d
class Solution {
public:
int longestSubstringWithoutDuplication(const string& str) {
int curLength = 0;
int maxLength = 0;
int* position = new int[26];
for (int i = 0; i < 26; ++i)
position[i] = -1;
for (int i = 0; i < str.length(); ++i) {
int prevIndex = position[str[i] - 'a'];
if (prevIndex < 0 || i - prevIndex > curLength)
++curLength;
else {
if (curLength > maxLength)
maxLength = curLength;
curLength = i - prevIndex;
}
position[str[i] - 'a'] = i;
}
if (curLength > maxLength)
maxLength = curLength;
delete[] position;
return maxLength;
}
};