LeetCode-3.无重复字符的最长子串

描述

分析
1.暴力求解法：$O(3)$O(3)

class Solution {
public:
    int getMaxLen(string s, int st)
    {
        int len = 0, length = s.length();
        for(int i = st;i < length;i++)
        {
            int flag = 1;
            for(int j = st;j < i;j++)
                if(s[j] == s[i]){flag = 0;break;}
            if(!flag)
                break;
            len++;
        }
        return len;
    }
    int lengthOfLongestSubstring(string s) 
    {
        int length = s.length();
        int maxlen = 0;
        for(int i = 0;i < length;i++)
        {
            int t = getMaxLen(s, i);
            maxlen = t > maxlen ? t : maxlen;
        }
        return maxlen;
    }
};