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.

https://leetcode.com/problems/longest-substring-without-repeating-characters/description/

总结:
1、当遇到重复的字符时,更换起始位置应该在这个重复字符第一次出现的位置,而不是第二次出现的位置。
2、回顾了下string的用法。

提交代码:

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int sub[500];
        int len=0,newlen=0;
        int n=s.length();
        memset(sub,-1,sizeof(sub));
        for(int i=0;i<n;i++)
        {
            if(sub[(int)s[i]]==-1)
            {
                newlen++;
                sub[(int)s[i]]=i;
                //cout<<(int)s[i]<<" "<<sub[(int)s[i]]<<endl;
            }
            else
            {
                i=sub[(int)s[i]]--;
                len=max(len,newlen);
                newlen=0;
                memset(sub,-1,sizeof(sub));
            }
        }
        len=max(len,newlen);
        //printf("%d\n",len);
        return len;
    }
};
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值