LEETCODE3. 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.

分析

遍历时遇到和前面重复的就断开前面重复处，并记住刚断开的串的长度len，继续从重复处往后构造新的一条串（新串的起始为断开处）。

如何判重：unordered_map

代码

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        unordered_map<char,int> map;
        
        int n=s.size();
        int left=0,len=0,tmp=0;
        
        for(int i=0;i<n;++i){
            
            // 在当前串中未出现
            if(map.find(s[i])==map.end()||map[s[i]]<left){
                tmp++;
                map[s[i]]=i;
            }
            // 出现在了已构串中，截掉
            else{
                left=map[s[i]]+1;
                map[s[i]]=i;
                len=max(len,tmp);
                tmp=i-left+1;
                
            }
            
        }
        len=max(len,tmp);
        
        return len;
    }
};