【leetcode】 算法题3 无重复字符的最长子串

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
       //cout << s << endl;
        uint64_t size = s.length(), begin = 0, end = 0, max_length = 0;
        for (int end = 0; end < size; end++) {
            for (int j = begin; j < end; j++) {
                //cout << begin << "\t" << end << endl;
                if (s[j] == s[end]) {
                    begin = j + 1;
                    continue;
                }
            }

            if (end - begin + 1 > max_length) {
                max_length = end - begin + 1;
            }
        }
        //cout << max_length << endl;
        return max_length;
    }
};