leetcode 日经贴，Cpp code -Longest Substring Without Repeating Characters
2015-04-16 23:54
351 查看
Longest Substring Without Repeating Characters
class Solution {
public:
int lengthOfLongestSubstring(string s) {
vector<int> mark(256);
int n = s.length();
if (n <= 1) return n;
int st = 0, ans = 1;
mark[s[0]] = 1;
for (int i = 1; i < n; ++i) {
if (!mark[s[i]]) {
mark[s[i]] = 1;
} else {
ans = max(ans, i - st);
while (s[st] != s[i]) {
mark[s[st++]] = 0;
}
++st;
}
}
ans = max(ans, n - st);
return ans;
}
};
内容来自用户分享和网络整理，不保证内容的准确性，如有侵权内容，可联系管理员处理 
相关文章推荐
- LeetCode 3_Longest Substring Without Repeating Characters
- [LeetCode]Longest Substring Without Repeating Characters
- [编程练习][Longest Substring Without Repeating Characters]<LeetCode-3>
- leetcode 之Longest Substring Without Repeating Characters
- [LeetCode]#3 Longest Substring Without Repeating Characters
- leetcode-java.T003_LongestSubstringWithoutRepeatingCharacters 给定一个字符串，找字符中的最大非重复子串
- Longest Substring Without Repeating Characters -- leetcode
- 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
- Leetcode 3: Longest Substring Without Repeating Characters
- [Leetcode]Longest Substring Without Repeating Characters
- LeetCode 03： Longest Substring Without Repeating Characters
- LeetCode: Longest Substring Without Repeating Characters 题解
- LeetCode力扣之Longest Substring Without Repeating Characters
- LeetCode 3 - Longest Substring Without Repeating Characters
- Longest Substring Without Repeating Characters -leetcode