leetcode 3. Longest Substring Without Repeating Characters
2017-10-10 19:04
465 查看
题意:求最长连续无重复的子串
分析:使用滑动窗口算法,left为左边界,i为右边界,(left,i]。
class Solution {
public:
int lengthOfLongestSubstring(string s) {
vector<int> a(256,-1);
int res=0;
int left=-1;
for(int i=0;i<s.size();i++){
if(left<a[s[i]])//说明了第二次被发现,使left跳到是s[i]第一次记录的位置,左边界
left=a[s[i]];
a[s[i]]=i;//给扫描过的字符赋值,即右边界
res=max(res,i-left);
}
return res;
}
};
分析:使用滑动窗口算法,left为左边界,i为右边界,(left,i]。
class Solution {
public:
int lengthOfLongestSubstring(string s) {
vector<int> a(256,-1);
int res=0;
int left=-1;
for(int i=0;i<s.size();i++){
if(left<a[s[i]])//说明了第二次被发现,使left跳到是s[i]第一次记录的位置,左边界
left=a[s[i]];
a[s[i]]=i;//给扫描过的字符赋值,即右边界
res=max(res,i-left);
}
return res;
}
};
相关文章推荐
- [LeetCode] 3. Longest Substring Without Repeating Characters
- leetcode--3. Longest Substring Without Repeating Characters
- LeetCode *** 3. Longest Substring Without Repeating Characters
- [LeetCode]3. Longest Substring Without Repeating Characters
- [LeetCode] 3. Longest Substring Without Repeating Characters
- leetcode 3. Longest Substring Without Repeating Characters
- leetCode刷题记录-3. Longest Substring Without Repeating Characters
- [LeetCode]3. Longest Substring Without Repeating Characters
- [leetcode]3. Longest Substring Without Repeating Characters
- 【Shawn-LeetCode】3. Longest Substring Without Repeating Characters
- leetcode --3. Longest Substring Without Repeating Characters
- leetcode 3. Longest Substring Without Repeating Characters
- [leetcode]3. Longest Substring Without Repeating Characters
- LeetCode 3. Longest Substring Without Repeating Characters
- [leetcode: Python]3. Longest Substring Without Repeating Characters
- LeetCode 3. Longest Substring Without Repeating Characters
- 【Leetcode】3. Longest Substring Without Repeating Characters
- LeetCode 3. Longest Substring Without Repeating Characters
- LeetCode题解(Week 16):3. Longest Substring Without Repeating Characters
- LeetCode - 3. Longest Substring Without Repeating Characters