【LeetCode】Longest Substring Without Repeating Characters

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
 const int MAX=256;
	 int last[MAX];
	 fill(last,last+MAX,-1);
	 int start=0;
	 int max_len=0;
	 for(int i=0;i<s.size();i++)
	 {
		 if(last[s[i]-'a']>=start)
		 {
			 max_len=max(i-start,max_len);
			 start=last[s[i]-'a']+1;
		 }
		 last[s[i]-'a']=i;
	 }
//	 cout<<max_len<<endl;
	 return max((int)s.size()-start,max_len);
    }
};

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
    if(s.size() <=1) return s.size();
        vector<int> lastPos(256,0); //store the last position of each charater as it scans the string.
        int max = 1; int lastMax = 1; lastPos[s[0]] = 1;
        //scan the string one by one.
        for(int i = 1; i < s.size(); i++){
            lastMax = min(lastMax+1,i+1-lastPos[s[i]]);
            lastPos[s[i]] = i+1;
            if(lastMax > max) max = lastMax;
        }
        return max;
    }
};