最长不重复子串

最新推荐文章于 2024-06-29 23:00:55 发布

图南ZHI

最新推荐文章于 2024-06-29 23:00:55 发布

阅读量361

点赞数 1

分类专栏： LeeCode 文章标签：最长不重复子串

本文链接：https://blog.csdn.net/langyao312/article/details/82780690

版权

LeeCode 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

最长不重复子串

题目描述

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 substri

代码

 int lengthOfLongestSubstring(string s) {
        if(s.size() == 0)
            return 0;
        vector<int> hash(256,-1);
        int currsum = 0;
        int maxsum = 0;
        for(size_t i = 0; i < s.size(); i++)
        {
            if(hash[s[i]] == -1 || currsum < i - hash[s[i]])
                currsum++;
            else
            {
                currsum = i - hash[s[i]];
            }
            maxsum = max(maxsum,currsum);
            hash[s[i]] = i;
        }
        return maxsum;
    }