题目:
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.
解题方法:采用双指针法,假设两个指针之间的字符串为所求子串,left为开区间,指向最左边字符的前一个位置,遍历的位置i为最右边的位置,当前字符的长度 i - left 。 使用res表示最长子串的长度,若当前子串长度大于res,则更新res 。每当遍历一个字符,就将 字符 -> 位置 构成映射关系,若有重复字符,记录最后一个位置,使用hashmap记录映射关系,同时,在记录当前字符的位置映射关系之前,先寻找hashmap中是否已经存在该字符,若存在且位置大于left,说明子串中存在重复字符,则将左指针指向该字符的位置,将该字符从子串中删除,同时更新该字符的映射位置。由于left和i都更新了,相应的res也会更新。
class Solution {
public:
int lengthOfLongestSubstring(string s) {
if(s.length() < 2)
return s.length();
unordered_map<int,int> map;
int left = -1;
int res = 0;
for(int i = 0;i < s.length();i++)
{
if(map.count(s[i]) && map[s[i]] > left)
left = map[s[i]];
map[s[i]] = i;
res = max(res,i-left);
}
return res;
}
};