[Leetcode] 3.Longest Substring Without Repeating Characters(unordered_map)
来源:互联网 发布:coach淘宝代购 编辑:程序博客网 时间:2024/06/02 05:35
通过把未访问的结点放到unordered_map中来判断是否重复,代码如下:
1 class Solution { 2 public: 3 int lengthOfLongestSubstring(string s) { 4 if(s == "") 5 return 0; 6 unordered_map<char,int> hash; 7 int len = 0; 8 int res = 0; 9 for(int i = 0;i < s.length();i ++)10 {11 if(hash.find(s[i]) != hash.end())12 {13 i = hash[s[i]];14 hash.clear();15 len = 0;16 }17 else18 {19 hash[s[i]] = i;20 len ++;21 res = max(len, res);22 }23 }24 return res;25 }26 };
阅读全文
0 0
- [Leetcode] 3.Longest Substring Without Repeating Characters(unordered_map)
- [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
- 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
- 3. Longest Substring Without Repeating Characters LeetCode
- (Leetcode)3. Longest Substring Without Repeating Characters
- leetcode 3. Longest Substring Without Repeating Characters
- 单例模式<静态内部类>
- [Leetcode] 1.Two Sum(unordered_map)
- [STL] map,multimap,unordered_map基本用法
- [Leetcode] 2.Add Two Numbers(List To Long,模拟)
- [BinaryTree] 二叉树类的实现
- [Leetcode] 3.Longest Substring Without Repeating Characters(unordered_map)
- 数据结构实验之图论一:基于邻接矩阵的广度优先搜索遍历
- [Leetcode] 4.Median of Two Sorted Arrays
- linux搭建mysql集群服务负载均衡搭建java连接mysql集群
- 正则表达式 \w \d . \s常用字符的简写
- LeetCode难度和面试频率(转)
- 函数中的静态变量
- [Leetcode] 8.String to Integer (atoi)
- [Leetcode] 15.3Sum