3. Longest Substring Without Repeating Characters

来源:互联网 发布:数据库修改语句例题 编辑:程序博客网 时间:2024/06/03 19:02
class Solution {public:    int lengthOfLongestSubstring(string s) {        int array[128];        memset(array, -1, sizeof(array));        int i = 0, j = 0, longest = 0;        while(i < s.length())        {            if(array[s[i]] >= j)            {                j = array[s[i]]+1;                array[s[i]] = i;            }            else            {                array[s[i]] = i;                longest = max(longest, i-j+1);            }            ++i;        }        return longest;    }};

0 0
原创粉丝点击