每日一题（day3）

Leetcode003

int lengthOfLongestSubstring(string s) {
int table[256];
int curlen = 0, maxlen = 0, curhead = 0, maxhead = 0;
memset(table, -1, sizeof(table));
for (int i = 0; i < s.length(); i++)
{
if (table[s[i]]<0)
{
table[s[i]] = i;
if (++curlen > maxlen)
{
maxlen = curlen;
maxhead = curhead;
}

}
else
{
curlen -= table[s[i]] - curhead;
for (int j = curhead; j < table[s[i]]; j++)
table[s[j]] = -1;
curhead = table[s[i]] + 1;
table[s[i]] = i;
}
}
return maxlen;
}