LeetCode 3: Longest Substring Without Repeating Characters

本文提供了一种高效的C++算法来解决寻找字符串中无重复字符的最长子串问题,通过实现一个类`Solution`,包含一个核心函数`lengthOfLongestSubstring`,该函数遍历字符串并利用数组`p_last_index`记录每个字符的最后出现位置,以此确定无重复字符子串的长度。

Difficulty: 3

Frequency: 2


Problem:

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.


Solution:

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        // Start typing your C/C++ solution below
        // DO NOT write int main() function
        int i_max_length = 0, i_max_length_from_end = 0;
        int p_last_index[26];
        memset(p_last_index, 0xFF, sizeof(int)*26);
        for (int i = 0; i<s.size(); i++)
        {
            if (p_last_index[s[i]-'a']==-1||(i-p_last_index[s[i]-'a'])>i_max_length_from_end)
            {
                p_last_index[s[i]-'a'] = i;
                i_max_length_from_end++;
                i_max_length = i_max_length>i_max_length_from_end?i_max_length:i_max_length_from_end;
            }
            else
            {
                i_max_length_from_end = i - p_last_index[s[i]-'a'];
                p_last_index[s[i]-'a'] = i;
            }   
        }
        return i_max_length;
    }
};

Notes:

Time complexity O(n).


评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值