Leetcode题解 - 3. Longest Substring Without Repeating Characters

最新推荐文章于 2024-01-06 13:50:14 发布

原创最新推荐文章于 2024-01-06 13:50:14 发布 · 279 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

标签

#leetcode

收录于

leetcode题解专栏收录该内容

23 篇文章

订阅专栏

本文介绍了一种高效算法来解决字符串中寻找最长无重复字符子串的问题，并通过实例展示了如何使用哈希表来实现这一目标。

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

Examples:

Given “abcabcbb”, the answer is “abc”, which the length is 3.

Given “bbbbb”, the answer is “b”, with the length of 1.

Given “pwwkew”, 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.

用一个哈希表存储访问过的字符，因为此处情况就是ascii字母表，用一个256的数组存储即可。每访问过一个字母，对应索引值加一，以此寻找最长非重复子串。

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        vector<int> idx(256,-1);
        int maxlen=0,m=0;
        for(int  i=0;i<s.size();i++){
            m=max(idx[s[i]]+1,m);
            idx[s[i]]=i;
            maxlen=max(maxlen,i-m+1);
        }
        return maxlen;
    }
};