Longest Substring Without Repeating Characters

最长无重复字符的子串

第一次提交：没有考虑字符串为空的情形。错误。

第二次提交：AC

思路：

1、判断字符串是否为空，若非空，进行下一步；

2、定义一个和字符串等长的整形数组 result[] 和一个字符数组。整形数组用于存放从每个字符开始计算无重复字符子串的长度，字符数组用于存放字符串（getChars方法）

3、双重循环。外层循环 len 次，内层循环每次计算result[i] 的值。判断当前字符是否在开始字符到当前字符之前的一个字符中间的字符串中出现过，若未出现过，result[i]++,否则跳出循环（用到substring() 和 indexOf()方法）。最后对result排序，返回最大值。

时间： 2024-12-26 19:07:51

Longest Substring Without Repeating Characters的相关文章

leetcode4 ---Longest Substring Without Repeating Characters

Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest subst

LeetCode: Longest Substring Without Repeating Characters 题解

LeetCode3 Longest Substring Without Repeating Characters

题目: Given a string, find the length of the longest substring without repeating characters. For example, the longest substring without repeating letters for "abcabcbb" is "abc", which the length is 3. For "bbbbb" the longest s

[LeetCode] 3. Longest Substring Without Repeating Characters

Given a string, find the length of the longest substring without repeating characters. Examples: Given "abcabcbb", the answer is "abc", which the length is 3. Given "bbbbb", the answer is "b", with the length of 1.

LeetCode Problem 3.Longest Substring Without Repeating Characters

Leetcode 03 Longest Substring Without Repeating Characters

Java for LeetCode 003 Longest Substring Without Repeating Characters

LeetCode Longest Substring Without Repeating Characters 最长不重复子串

题意:给一字符串,求一个子串的长度,该子串满足所有字符都不重复.字符可能包含标点之类的,不仅仅是字母.按ASCII码算,就有2^8=128个. 思路:从左到右扫每个字符,判断该字符距离上一次出现的距离是多少,若大于max,则更新max.若小于,则不更新.每扫到一个字符就需要更新他的出现位置了.这里边还有个注意点,举例说明: 假如有长为16串 s="arbtbqwecpoiuyca" 当扫到第2个b时,距离上一个b的距离是2:(直接减) 当扫到第2个c时,距离上一个c的距离是6:(直接减