leetcode 3. Longest Substring Without Repeating Characters

来源:互联网 发布:网络直播的看法与态度 编辑:程序博客网 时间:2024/06/14 09:36
class Solution {public:    int lengthOfLongestSubstring(string s) {        int p[256];        memset(p,-1,sizeof(p));        int ans = 0, flag = -1;        for(int i = 0;i < s.length();i++){            flag = max(flag,p[s[i]]);            p[s[i]] = i;            ans = max(ans,i-flag);        }        return ans;    }};

0 0
原创粉丝点击