最长子串(Leetcode-3 Longest Substring Without Repeating Characters)
2017-04-12 20:29
381 查看
Question:
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.
问题描述:
给一个字符串,找出这个字符串的无重复字符的最长子串的长度。
实例:
1,“abcabcbb”的最长子串是“abc”,长度为3。
2,“bbbbb”的最长子串是“b”,长度为1。
3,“pwwkew”的最长子串是“wke”,长度为3。
解题思路:
这个题的关键在于重复的字符!
一个子串不可能出现重复的字符,那么我们可以用两个指针,一个指针用来遍历字符串,两个指针之间保持无重复字符,那么两个指针之间的长度即最大子串的长度。当发现有重复的字符时,另一个指针指向这个字符上一次出现的位置的下一个字符,继续遍历,直到找到最长子串。
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; }View Code
相关文章推荐
- leetcode(三)—— Longest Substring Without Repeating Characters(最长不重复子串 Python/C++)
- 【LeetCode】Longest Substring Without Repeating Characters && 【九度】题目1530:最长不重复子串
- LeetCode-Longest Substring Without Repeating Characters-最长不重复子串-滑动窗口
- LeetCode-3 Longest Substring Without Repeating Characters(最长无重复子串)
- [C++]LeetCode 3: Longest Substring Without Repeating Characters(最长不重复子串)
- LeetCode - Longest Substring Without Repeating Characters(最长不重复子串)
- LeetCode: 3_Longest Substring Without Repeating Characters | 求没有重复字符的最长子串的长度 | Medium
- leetcode-Longest Substring Without Repeating Characters 最长不重复子串
- [LeetCode] Longest Substring Without Repeating Characters最长无重复子串
- leetcode 3 Longest Substring Without Repeating Characters最长无重复子串
- LeetCode题库解答与分析——#3.无重复字符的最长子串LongestSubstringWithoutRepeatingCharacters
- 【LeetCode】4. Longest Substring Without Repeating Characters 最长无重复子串
- LeetCode:Longest Substring Without Repeating Characters(最长不重复子串)
- LeetCode Longest Substring Without Repeating Characters 最长不重复子串查找
- leetcode 3 Longest Substring Without Repeating Characters最长无重复子串
- [LeetCode] Longest Substring Without Repeating Characters 最长无重复子串
- leetcode 3 : Longest Substring Without Repeating Characters 最长无重复子串 (C# 语言版)
- LeetCode-3:Longest Substring Without Repeating Characters (最长无重复字符的子串) --medium
- [LeetCode] Longest Substring Without Repeating Characters 无重复字符的最长子串
- LeetCode Longest Substring Without Repeating Characters 最长不重复子串