<3>—— Longest Substring Without Repeating Characters
2017-08-19 17:15
323 查看
3、Longest Substring Without Repeating Characters
最长无重复字符的子串
给定一个字符串,请找出其中无重复字符的最长子字符串。样例
例如,在
"abcabcbb"中,其无重复字符的最长子字符串是
"abc",其长度为
3。
对于,
"bbbbb",其无重复字符的最长子字符串为
"b",长度为
1。
class Solution { public: int lengthOfLongestSubstring(string s) { vector<int> charIndex(256,-1);//哈希表 int Longest=0,start=-1;//最大长度,字符串头的位置 for(int i=0;i!=s.length();++i) { if(charIndex[s[i]]>start)//如果出现重复元素 start=charIndex[s[i]];//start就跳转到上一次出现该元素的位置后开始记录 charIndex[s[i]]=i;//记录出现元素的位置 Longest=max(Longest,i-start); } return Longest; } };
相关文章推荐
- <LeetCode><Medium> 3 Longest Substring Without Repeating Characters
- [编程练习][Longest Substring Without Repeating Characters]<LeetCode-3>
- LeetCode-Longest Substring Without Repeating Characters<ERROR>
- C实现 LeetCode->Longest Substring Without Repeating Characters
- LeetCode第三关:Longest Substring Without Repeating Characters --> Difficulty: Medium
- Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- Leetcode之Longest Substring Without Repeating Characters 问题
- Longest Substring Without Repeating Characters (最长无重复字符的子串)
- LeetCode 3 Longest Substring Without Repeating Characters
- Leetcode3:Longest Substring Without Repeating Characters@Python
- LeetCode_Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters
- LeetCode题解 || Longest Substring Without Repeating Characters (O(n)算法)问题
- Leetcode_003_Longest_Substring_Without_Repeating_Characters
- Longest Substring Without Repeating Characters
- 【leetcode】Longest Substring Without Repeating Characters
- LeetCode 3 Longest Substring Without Repeating Characters
- HashTable-3-Longest Substring Without Repeating Characters