[Leetcode] Longest Substring Without Repeating Characters

来源:互联网 发布:360软件管家mac版 编辑:程序博客网 时间:2024/04/29 08:22
class Solution {public:    int lengthOfLongestSubstring(string s) {        // Start typing your C/C++ solution below        // DO NOT write int main() function        if (s.size() == 0) return 0;                int buf[256];        for (int i = 0; i < 256; ++i)            buf[i] = -1;                    int front = 0;        buf[s[front]] = 0;        int maxLen = 1;        int curLen;        for (int i = 1; i < s.size(); ++i)        {            if (buf[s[i]] != -1)            {                if (buf[s[i]] >= front)                    front = buf[s[i]] + 1;                buf[s[i]] = i;            }            else                buf[s[i]] = i;                            curLen = i - front + 1;            if (curLen > maxLen)                maxLen = curLen;        }                return maxLen;    }};

原创粉丝点击