首页 > 代码库 > 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 a substring, "pwke" is a subsequence and not a substring.
HashMap
public class Solution { public int lengthOfLongestSubstring(String s) { int max = 0; int start = 0; int end = 0; if(s.isEmpty()){ return 0; } max = 1; HashMap<Character, Integer> map = new HashMap<Character, Integer>(); char stringArray[] = s.toCharArray(); while(end < s.length()){ if(map.containsKey(stringArray[end])){ if((end - start) > max) max = end - start ; if(map.get(stringArray[end]) >= start) start = map.get(stringArray[end]) + 1 ; } map.put(stringArray[end], end); end++; } return Math.max(max, end - start); }}
Longest Substring Without Repeating Characters
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。