无重复字符的最长子串

无重复字符的最长子串

class Solution {
public:
 int lengthOfLongestSubstring(string s)
 {
  int n = s.size();
  if (n == 0)
  {
   return 0;
  }
  if (n == 1)
  {
   return 1;
  }
  int start(0), end(0), length(0), result(0);
  while (end<n)
  {
   char tmpChar = s[end];
   for (int i = start; i < end; i++)
   {
    if (tmpChar == s[i])
    {
     start = i + 1;
     length = end - start;
     break;
    }
   }
   ++end;
   ++length;
   if (result<length)
   {
    result = length;
   }
  }
  return result;
 }
};