[LeetCode] 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.

解题思路：

  创建一个字符的hash表，通过向后索引的方式查找表中是否存在当前的字符，当存在时删除当前字符索引长度，然后与记录的最大长度比较。

class Solution {
public:
	int lengthOfLongestSubstring(string s);
};

int
Solution::lengthOfLongestSubstring(string s) {
	const int sz = s.size();
	int max_length = 0;
	int length = 0;
	int index = 0;
	vector<int> chash(300);

	for (char& cindex : s) {
		if (chash[cindex] == 1) {
			max_length = max_length < length ? length : max_length;
			while (1) {
				length--;
				char check = s.c_str()[index++];
				chash[check] = 0;
				if (chash[cindex] == 0) break;
			}
		}
		chash[cindex] = 1;
		length++;
	}

	return max_length = max_length < length ? length : max_length;
}