LeetCode:Longest Substring Without Repeating Characters

题目链接：https://leetcode.com/problems/longest-substring-without-repeating-characters/description/

题目介绍：给一字符串，找出不含重复字符的最长子串的长度

解题思路：从一个字符开始，往后寻找不含重复字符的最长子串，然后记录其中的最大值。

代码如下：

class Solution {
public:
    int lengthOfLongestSubstring(string s) {
        int max = 0;
        if (s.size() == 0 || s.size() == 1) return s.size();
        for (int i = 0; i < s.size() - 1; i++) {
            string t;
            t += s[i];
            for (int j = i + 1; j < s.size(); j++) {
                int repeat = 0;
                for (int k = 0; k < t.size(); k++) {
                    if (t[k] == s[j]) {
                        repeat = 1;
                    }
                }
                if (repeat == 1) {
                    break;
                }
                else {
                    t += s[j];
                }
            }
            if (max < t.size()) {
                max = t.size();
            }
        }
        return max;
    }
};