关闭

LeetCode:Longest Substring Without Repeating Characters

标签: LeetCodeLongest Substring Wi
3111人阅读 评论(0) 收藏 举报
分类:

Longest Substring Without Repeating Characters




Total Accepted: 152787 Total Submissions: 687012 Difficulty: Medium

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.

Subscribe to see which companies asked this question





















思路:

维护一个HashMap存储每个字符的位置;两个指针i,j,维护最长子串的范围。


java code:

public class Solution {
    public int lengthOfLongestSubstring(String s) {
        
        if(s==null || 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++) {
            char c = s.charAt(i);
            if(map.containsKey(c)) {
                j = Math.max(j, map.get(c)+1);
            }
            map.put(c, i);
            max = Math.max(max, i-j+1);
        }
        return max;
    }
}


0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:324630次
    • 积分:6130
    • 等级:
    • 排名:第4065名
    • 原创:310篇
    • 转载:1篇
    • 译文:0篇
    • 评论:22条
    博客专栏
    最新评论