LeetCode Longest Substring Without Repeating Characters
2014-12-30 15:34
435 查看
Longest Substring Without Repeating Characters
Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" thelongest substring is "b", with the length of 1.
Show Tags
题意:求最长的没有重复字母的子串
思路:双指针的方法,一个指向当前子串的头(左边),一个指向尾(右边),显然如果尾指针的这个字符出现过的话,那么头指针就要跳到相应的位置了,遍历一遍找最大的
class Solution { public: int lengthOfLongestSubstring(string s) { int Max = 0; int cur = -1; int vis[256]; memset(vis, -1, sizeof(vis)); for (int i = 0; i < s.length(); i++) { if (vis[s[i]] > cur) cur = vis[s[i]]; Max = max(Max, i - cur); vis[s[i]] = i; } return Max; } };
相关文章推荐
- [LeetCode]-algorithms-Longest Substring Without Repeating Characters
- LeetCode之Longest Substring Without Repeating Characters
- C实现 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
- LeetCode - Longest Substring Without Repeating Characters(最长不重复子串)
- [LeetCode] Longest Substring Without Repeating Characters
- LeetCode3:Longest Substring Without Repeating Characters
- LeetCode:Algorith3 —Longest Substring Without Repeating Characters
- Leetcode:Longest Substring Without Repeating Characters
- LeetCode--Longest Substring Without Repeating Characters(字符串Hash)
- LeetCode: Longest Substring Without Repeating Characters
- LeetCode题库解答与分析——#3.无重复字符的最长子串LongestSubstringWithoutRepeatingCharacters
- Leetcode 3 Longest Substring Without Repeating Characters
- leetcode-Longest Substring Without Repeating Characters
- [LeetCode]Longest Substring Without Repeating Characters
- [Leetcode]Longest Substring Without Repeating Characters
- leetcode:Longest Substring Without Repeating Characters
- [LeetCode] Longest Substring Without Repeating Characters