LeetCode 3 Longest Substring Without Repeating Characters
来源:互联网 发布:dhcp 端口 编辑:程序博客网 时间:2024/06/14 04:33
题意:给出一个字符串,求出最长的不重复子串的长度。
思路:从左向右扫描一遍,记录每个字母出现的最晚位置,然后根据以前一个位置结束的最长子串和当前字母出现的最晚位置递推出以当前位置结束的最长不重复子串长度。
class Solution {public: int lengthOfLongestSubstring(string s) { int ans = 0; int pos[200]; int last = 0; int len = s.length(); memset(pos, -1, sizeof(pos)); for (int i = 0; i < len; i++) { if (pos[s[i]] < i-last) ans = max(++last, ans); else last = i - pos[s[i]]; pos[s[i]] = i; } return ans; }};
0 0
- 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 3LONGEST 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]3Longest 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
- NBUT [1647] 又一道简单题
- 线程间通信--多生产者多消费者问题
- 猜数字
- UVA - 11093 Just Finish it up 难道我这是神解?
- 第四周项目五-用递归方法求解(用递归求出两个数的最大公约数)
- LeetCode 3 Longest Substring Without Repeating Characters
- 用setTag()和getTag()来优化Listview
- HDU 4081 次小生成树变形记
- 其它文章--我不写,只记录我看过的一些东西,以便不用重复百度。
- c#多维数组
- HDU3613 Best Reward 3连发之KMP
- 个人所得税计算器
- XMPP
- 几个sql语句例子