3. Longest Substring Without Repeating Characters

Given a string, find the length of the longest substring without repeating characters.

Examples:

Given “abcabcbb”, the answer is “abc”, which the length is 3.

Given “bbbbb”, the answer is “b”, with the length of 1.

Given “pwwkew”, the answer is “wke”, with the length of 3. Note that the answer must be a substring, “pwke” is a subsequence and not a substring.

---

采用了双端队列Deque类，该类的具体描述可以参加Java 容器源码分析之 Deque 与 ArrayDeque
通过观察源码可以发现利用位操作实现环形队列的方法
代码如下：

class Solution {
    public int lengthOfLongestSubstring(String s) {
        if(s == null)
            return 0;
        int max = 0;
        ArrayDeque<Character> ad = new ArrayDeque<>();
        for(int i = 0; i < s.length(); i++){
            if(ad.contains(s.charAt(i))){
                max = Math.max(max, ad.size());
                while(s.charAt(i) != ad.removeFirst());
                ad.addLast(s.charAt(i));
            }
            else{
                ad.addLast(s.charAt(i));
            }
        }
        max = Math.max(max, ad.size());
        return max;
    }
}