3. Longest Substring Without Repeating Characters**

最新推荐文章于 2017-02-25 21:23:41 发布

Yingying_code

最新推荐文章于 2017-02-25 21:23:41 发布

阅读量184

点赞数

分类专栏： leetcode Java String

本文链接：https://blog.csdn.net/alwaystry/article/details/53997800

版权

leetcode 同时被 3 个专栏收录

261 篇文章 0 订阅

订阅专栏

Java

188 篇文章 0 订阅

订阅专栏

String

21 篇文章 0 订阅

订阅专栏

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.

    public int lengthOfLongestSubstring(String s) {
        if (s.length()==0) return 0;
        HashMap<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;
   }

总结：j 记录的是字符串开始的位置