【Leetcode 3】Longest Substring Without Repeating Characters
来源：互联网 发布：天龙抢号软件 编辑：程序博客网 时间：2024/06/07 11:26
题意：给定一个字符串，求出最长的子串，这个子串中要求不能有相同的字符。
思路：hash的思想，开个一个数组记下前一个相同字符的位置，然后在遍历过程中记下最大值（相当于往前能延伸的最前面的位置），即可求解答案。
class Solution {public: int lengthOfLongestSubstring(string s) { int pos[300]; memset(pos,-1,sizeof(pos)); int ans=0; int now_max=-1;//往前能延伸的最前面的位置 for(int i=0;i<s.length();++i){ if(pos[s[i]]>now_max) now_max=pos[s[i]]; ans=max(i-now_max,ans); 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
- SpringMVC HandlerMethodArgumentResolver自定义参数转换器 针对HashMap失效的问题
- Java常用工具类封装——DES加密和解密的工具类
- mysql慢查询
- 中国剩余定理（互质与不互质的情况）
- linux shell （三）
- 【Leetcode 3】Longest Substring Without Repeating Characters
- Java
- C++Primer 5th_Exercise 习题答案
- Java常用工具类封装——Base64 编码和解码
- linux命令time
- PAT1012. 数字分类 (20)
- LeetCode 53. Maximum Subarray
- 僵尸进程与孤儿进程
- 【Bootstrap学习笔记1】基础
