首页 > 其他 > 详细

3. Longest Substring Without Repeating Characters

时间:2016-03-13 11:21:32      阅读:107      评论:0      收藏:0      [点我收藏+]

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.

int lengthOfLongestSubstring(char* s) {
    int latestPos[128]; //map<char,int>
    int result = 0;
    int i = 1;
    int startPos = 0;

    if(strcmp(s,"")==0) return result;
    
    memset(latestPos, -1, sizeof(latestPos));
    latestPos[s[0]] = 0;
    while(s[i]!=\0){
        if(latestPos[s[i]] >= startPos){ //s[i] already appeared
            if(i-startPos > result) result = i-startPos;
            startPos = latestPos[s[i]]+1;
        }
        latestPos[s[i]] = i;
        i++;
    }
    if(i-startPos > result) result = i-startPos;
    return result;
}

 

3. Longest Substring Without Repeating Characters

原文:http://www.cnblogs.com/qionglouyuyu/p/5271415.html

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!