LeetCode "Longest Substring Without Repeating Characters"

最新推荐文章于 2025-08-12 19:46:01 发布

转载最新推荐文章于 2025-08-12 19:46:01 发布 · 59 阅读

0 ·

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/tonix/p/3900488.html

文章标签：

#开发工具

本文介绍了一种解决最长无重复字符子串问题的有效方法，通过单调队列优化了动态规划解决方案，避免了时间复杂度过高的问题。文章提供了一个C++实现示例，并对比了动态规划与单调队列两种方案。

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

What a juicy problem to solve :) My intuition is DP, but failed with TLE. Then I referred to:

http://leetcode.com/2011/05/longest-substring-without-repeating-characters.html

Essentially, it is Monotonous Queue I met last month !

So, another advice:

When you have a DP solution to a 1D space, think about the possibility of Monotonous Queue for a further optimization!

class Solution {
public:
    //     Idea is like Mono-Queue
    int lengthOfLongestSubstring(string s) {
        int len = s.length();
        if (len < 1) return len;

        int maxLen = 1;
        unordered_map<char, int> rec;
        int start = 0;
        int i;
        for (i = 0; i < len; i++)
        {
            char c = s[i];
            if (rec.find(c) == rec.end())
            {
                rec.insert(make_pair(c, i));
            }
            else
            {
                maxLen = std::max(maxLen, i - start);                
                
                int iFound = rec[c];
                for (int i = start; i <= iFound; i++)
                    rec.erase(s[i]);
                rec.insert(make_pair(c, i));
                start = iFound + 1;                
            }
        }
        maxLen = std::max(maxLen, i - start);
        return maxLen;
    }
};