Longest Substring Without Repeating Characters

最新推荐文章于 2025-05-18 01:04:12 发布

翻译最新推荐文章于 2025-05-18 01:04:12 发布 · 428 阅读

文章标签：

#LeetCode

LeetCode 专栏收录该内容

36 篇文章

订阅专栏

本文介绍了一种算法，用于解决给定字符串中找到最长无重复字符子串的问题。通过遍历字符串并使用标记数组来跟踪字符出现情况，算法能够有效计算出目标子串的长度。

Longest Substring Without Repeating Characters

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest substring is "b", with the length of 1.

Code:

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        bool sign[256];
        int ret=0;
        memset(sign,0,sizeof(sign));
        for(int i=0,j=0;i<s.size();i++)
        {
            while(sign[s[i]]==1)
            {
                sign[s[j]]=0;
                j++;
            }
            sign[s[i]]=1;
            ret=max(ret,i-j+1);
        }
        return ret;
    }
};