3. Longest Substring Without Repeating Characters
来源：互联网 发布：共享需要输入网络凭据 编辑：程序博客网 时间：2024/06/05 21:17
计算字符串中的最长不重复子串
用到map，一次遍历
if (s.length()==0) return 0;
HashMap<Character, Integer> map = new HashMap<Character, Integer>();
int max=0;
for (int i=0, j=0; i<s.length(); ++i){
if (map.containsKey(s.charAt(i))){
j = Math.max(j,map.get(s.charAt(i))+1);
}
map.put(s.charAt(i),i);
max = Math.max(max,i-j+1);
}
return max;
0 0
- [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] 3. Longest Substring Without Repeating Characters
- 3.Longest Substring Without Repeating Characters
- 3. Longest Substring Without Repeating Characters
- 3.Longest Substring Without Repeating Characters
- 3.Longest Substring Without Repeating Characters
- 3.Longest Substring Without Repeating Characters
- 3. Longest Substring Without Repeating Characters
- [leetcode] 3.Longest Substring Without Repeating Characters
- 3.Longest Substring Without Repeating Characters
- [leetcode] 3. Longest Substring Without Repeating Characters
- 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
- 解决“tensorboard：未找到命令”的问题
- Mysql命令大全
- git操作总结
- bladeRF无线门控钥匙信号重放小记
- mybatis 更新查询操作 6了我的哥
- 3. Longest Substring Without Repeating Characters
- 树莓派(linux,ubuntu) 安装vnc服务端 Unable to locate package tightvnserver 解决
- 链表表示的 一元多项式，无参构造器，有参构造器，相加，遍历
- C/C++_log2000_typedef和enum
- 数据驱动---文件读取（file）
- Android高性能编程(1)--基础篇
- VARATT_EXTERNAL_GET_POINTER
- 大小端模式
- 单例c#
