无重复字符的最长子串

public int lengthOfLongestSubstring1(String s) {
    int count = 0;
    Queue<Character> queue = new LinkedList<>();
    int length = s.length();
    for (int i = 0; i < length; i++) {
        char c = s.charAt(i);
        while (queue.contains(c)) {
            queue.poll();
        }
        queue.offer(c);
        count = Math.max(queue.size(), count);
    }
    return count;
}

public int lengthOfLongestSubstring(String s) {
    if (s.length() <= 1) {
        return s.length();
    }

    int maxLength = 0, i = 0, j = 1;
    while (j < s.length()) {
        if (!s.substring(i, j).contains(String.valueOf(s.charAt(j)))) {
            maxLength = Math.max(maxLength, j - i + 1);
            j++;
        } else {
            if (i < j) {
                i++;
            } else {
                j++;
            }
        }
    }
    return maxLength;
}