无重复字符的最长子串
Algorithm
3. Longest Substring Without Repeating Characters
Description
Given a string s, find the length of the longest substring without repeating characters.
Example 1:
Input: s = "abcabcbb"
Output: 3
Explanation: The answer is "abc", with the length of 3.
Example 2:
Input: s = "bbbbb"
Output: 1
Explanation: The answer is "b", with the length of 1.
Example 3:
Input: s = "pwwkew"
Output: 3
Explanation: The answer is "wke", with the length of 3.
Notice that the answer must be a substring, "pwke" is a subsequence and not a substring.
Example 4:
Input: s = ""
Output: 0
Constraints:
- 0 <= s.length <= 5 * 104
- s consists of English letters, digits, symbols and spaces.
class Solution {
public int lengthOfLongestSubstring(String s) {
if(s==null||s.length()==0){
return 0;
}
int max = 0;
Map map = new HashMap<>();
for(int i=0,j=0;
i Code
【无重复字符的最长子串】3. Longest Substring Without Repeating Characters
推荐阅读
- 学无止境，人生还很长
- jhipster|jhipster 升级无效问题
- 说的真好
- 一起来学习C语言的字符串转换函数
- C语言字符函数中的isalnum()和iscntrl()你都知道吗
- 解决SpringBoot引用别的模块无法注入的问题
- 抱着梦的无眠
- 松软可口易消化，无需烤箱超简单，新手麻麻也能轻松成功~
- 公园游
- 2018-07-27读书心得