leetcode 刷题 3. Longest Substring Without Repeating Characters

Longest Substring Without Repeating Characters

• Given a string, find the length of the longest substring without repeating characters.

• Example 1:
  Input: “abcabcbb”
  Output: 3
  Explanation: The answer is “abc”, with the length of 3.

• Example 2:
  Input: “bbbbb”
  Output: 1
  Explanation: The answer is “b”, with the length of 1.

• Example 3:
  Input: “pwwkew”
  Output: 3
  Explanation: The answer is “wke”, with the length of 3.
  Note that the answer must be a substring, “pwke” is a subsequence and not a substring.

代码

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
      vector<int> dict(256, -1);			//ASCII码中8位二进制
	    int maxLen = 0, start = -1;	
	    for (int i = 0; i != s.length(); i++) {
 	       if (dict[s[i]] > start)						//判断该字符是否之前出现过
 	           start = dict[s[i]];					
  	      dict[s[i]] = i;
	        maxLen = max(maxLen, i - start);
     }
      return maxLen;
   }
};