3. Longest Substring Without Repeating Characters

最新推荐文章于 2025-08-12 12:49:47 发布

happy_doy

最新推荐文章于 2025-08-12 12:49:47 发布

阅读量323

点赞数

CC 4.0 BY-SA版权

分类专栏： leetcode 文章标签： leetcode

本文链接：https://blog.youkuaiyun.com/happy_doy/article/details/70878178

leetcode 专栏收录该内容

1 篇文章

订阅专栏

本文介绍了一种寻找给定字符串中最长无重复字符子串的算法实现，并提供了C++代码示例。通过遍历字符串并使用数组记录字符出现次数的方法来确保子串中字符的唯一性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Subscribe to see which companies asked this question.
题意：就是给你一个字符串，找出最长不相同的字符串，例如：pwwkew的结果就是3（wke）
c++方法：
代码：

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int len = s.length();
        int maxx = 0,ans;
        int arr[400];
        bool flag = 0;
        for(int i=0;i<len;i++)
        {
            ans = 1,flag = 0;
            memset(arr,0,sizeof(int)*400);
            arr[s[i]]++;
            for(int j=i+1;j<len;j++)
            {
                arr[s[j]]++;
                if(arr[s[j]]>1)
                    break;
                if(s[i] != s[j])
                    ans++;
                else
                    break;
            }
            if(ans>maxx)
                maxx = ans;
        }
        return maxx;
    }
};