【LeetCode】3. Longest Substring Without Repeating Characters

3.Longest Substring Without Repeating Characters

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.

思路

没有重复字符的最长子串

使用map来存储字符串以及对应的索引,建立一张索引表。以起点start开始查找,若无重复字符,则maxlen = i-start

abcabcbb
^  ^
s  i

当字符查表已存在,更新起点start为当前字符索引

Solution

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        unordered_map<char,int> char_map;
        int maxlen= 0;
        int start = -1;
        for(int i = 0; i<s.length();i++){
            if(char_map.count(s[i])!=0){
                start = max(start,char_map[s[i]]);
            }
            char_map[s[i]]=i;
            maxlen = max(maxlen,i-start);
        }
        return maxlen;
    }
};

LeetCode代码和详细解题报告 Github地址https://github.com/zhengjingwei/LeetCode

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值