Longest Substring Without Repea

作者: Wenyue_offer | 来源:发表于2017-09-12 15:06 被阅读0次

Longest Substring Without Repea
Longest Substring Without Repea
LeetCode 3. Longest Substring Wi
最长无重复子串（Java）Longest Substring W
3 longest substring without repe
3 Longest Substring Without Repe
2020-02-25 Day3 Leetcode:3. Long
100DaysLeetcode(3)
每日算法之LeetCode 3:Longest Substrin
leetcode-day2

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

网友评论

本文标题： Longest Substring Without Repea

本文链接：https://www.haomeiwen.com/subject/txmcsxtx.html

延伸阅读

深度阅读

您也可以注册成为美文阅读网的作者，发表您的原创作品、分享您的心情！

Longest Substring Without Repea

相关文章

Longest Substring Without Repea

Longest Substring Without Repea

LeetCode 3. Longest Substring Wi

最长无重复子串（Java）Longest Substring W

3 longest substring without repe

3 Longest Substring Without Repe

2020-02-25 Day3 Leetcode:3. Long

100DaysLeetcode(3)

每日算法之LeetCode 3:Longest Substrin

leetcode-day2

网友评论

延伸阅读

深度阅读

栏目导航

热点阅读