leetCode---Longest Substring Without Repeating Characters

一. 题目：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 asubstring,"pwke" is a subsequence and not a substring.

Subscribe to see which companies asked this question

二. 思路分析

基本的想法是，让一个HashMap存储字符的字符串作为键及其位置的值，并保持两个指针定义的最大子串。移动右边的指针扫描字符串，同时更新HashMap。如果角色已经在HashMap，然后将左手指向右上发现相同的字符。注意，两个指针只能向前移动。

  public int lengthOfLongestSubstring(String s) {
        if (s.length()==0) return 0;
        Map<Character, Integer> map = new HashMap<Character, Integer>();
        int max=0;
        for (int i=0, j=0; i<s.length(); ++i){
            if (map.containsKey(s.charAt(i))){
                j = Math.max(j,map.get(s.charAt(i))+1);
            }
            map.put(s.charAt(i),i);
            max = Math.max(max,i-j+1);
        }
        return max;
    }