LeetCode:Longest Substring Without Repeating Characters

 1 class Solution {
 2 public:
 3     int lengthOfLongestSubstring(string s) {
 4         int asc[180]={-1},max=0,n=0,i=0,j;
 5         for(j=0;j<180;j++)
 6                 asc[j]=-1;
 7         while(i<s.size())
 8         {
 9             if(asc[s[i]]==-1)
10             {
11                 asc[s[i]]=i;
12                 n++;
13                 if(n>max)
14                     max=n;
15             }
16             else
17             {
18                 
19                 int k=asc[s[i]]; 
20                 n=i-k;
21                 for(j=0;j<180;j++)
22                 {
23                     if(asc[j]>-1&&asc[j]<k)
24                         asc[j]=-1;
25                 }
26                 asc[s[i]]=i;
27             }
28             i++;
29         }
30         return max;
31     }
32 };