leetcode Longest Substring Without Repeating Character(Java)
来源：互联网 发布：程序员群头像 编辑：程序博客网 时间：2024/06/05 10:47
题目链接：点击打开链接
类型：
解法：记录每一子串起始位置和长度，并与当前最大长度进行比较
public class Solution { public int lengthOfLongestSubstring(String s) {if (s.length() == 0) return 0;if (s.length() == 1) return 1;int max_len = 1;HashMap<Character, Integer> map = new HashMap<>();int begin = 0;int len = 1;for (int i=0 ; i<s.length() ; ++i){if (map.containsKey(s.charAt(i))){begin = Math.max(begin, map.get(s.charAt(i))+1);}map.put(s.charAt(i), i);len = i - begin + 1;max_len = (max_len > len) ? max_len : len;}return max_len; }}阅读全文
0 0
- leetcode Longest Substring Without Repeating Character(Java)
- longest substring without repeating character leetcode c++
- LeetCode: Longest Substring Without Repeating Character
- Longest Substring Without Repeating Character
- [Leetcode] Longest Substring Without Repeating Characters (Java)
- Longest Substring Without Repeating Characters -- Leetcode Java
- [Leetcode]Longest Substring Without Repeating Characters java
- [LeetCode][Java] Longest Substring Without Repeating Characters
- LeetCode java Longest Substring Without Repeating Characters
- LeetCode : Longest Substring Without Repeating Characters [java]
- Java-LeetCode-Longest Substring Without Repeating Characters
- Java Leetcode Longest Substring Without Repeating Characters
- 【LeetCode】 Longest Substring Without Repeating Characters(Java)
- Longest Substring Without Repeating Characters leetcode java
- 《leetcode》longest-substring-without-repeating
- 3 Longest Substring Without Repeating Character
- 3 Longest substring without repeating character
- LEETCODE3. Longest Substring Without Repeating Character
- 二叉搜索树与双向链表
- 汇编语言（第三版）检测点笔记
- Kotlin基础教程-运算符重载
- 电子信息工程专业大一学生的软件之路
- 检查nginx反向代理节点状态
- leetcode Longest Substring Without Repeating Character(Java)
- thrift
- 5-9 互评成绩 (25分)
- 欢迎使用CSDN-markdown编辑器
- ARKit从入门到精通（1）-ARKit初体验
- node
- python中从str中提取元素到list以及将list转换为str
- reduce&compose&applyMiddleware&redux-thunk
- EventBus 使用心得
