[LeetCode] Longest Substring Without Repeating Characters

最新推荐文章于 2024-10-16 19:20:14 发布

xiaoli727

最新推荐文章于 2024-10-16 19:20:14 发布

阅读量61

点赞数 1

分类专栏： LeetCode 文章标签： c++ 动态规划

本文链接：https://blog.csdn.net/sinat_24796205/article/details/119396866

版权

LeetCode 专栏收录该内容

20 篇文章 0 订阅

订阅专栏

Description

Longest Substring Without Repeating Characters: Given a string s, find the length of the longest substring without repeating characters.
Example:

Input: s = "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3.
Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.

Solution

The basic idea is to use a dictionary (called cache) to keep track where the character last appeared.

This is easy to see that length = end - start. For each character, we take its index as end. For start, we hope to use the index, all characters after it are not repeated. So, the start will be the maximum of start and the index of the character last appeared. Finally, we return the max length.
The idea is as follows:
在这里插入图片描述

Code

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        vector<int> cache(256, -1);
        
        int start = -1, maxRes = 0;
        for(int i = 0; i < s.length(); i++) {
            start = max(start, cache[s[i]]);
            cache[s[i]] = i;
            maxRes = max(maxRes, i - start);
        }
        return maxRes;
    }
};