最长不含重复字符的子字符串

题目：青葱字符串中找出一个最长的不包含重复字符的子字符串，计算该最长子字符串的长度。

#include<iostream>
#include<string>
using namespace std;
int longestSubstringWithoutDuplication_2(const std::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;
}
int main()
{
string s = "arabcacfr";
int ret = longestSubstringWithoutDuplication_2(s);
cout << ret;
getchar();
return 0;
}