首页 > 代码库 > 3. Longest Substring Without Repeating Characters
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.
Given "pwwkew", the answer is "wke", with the length of 3. Note that the answer must be a substring, "pwke" is a subsequence and not a substring.
复杂度：
时间：O(n^2)、空间：O(1)
实现：
public class Solution {
public int lengthOfLongestSubstring(String s) {
int first = 0, stepMax = 1, max = s.length() > 0 ? 1 : 0;
for(int i = 1; i < s.length(); i++) {
boolean stop = false;
for(int j = first; j < i; j++) {
if(s.charAt(j) == s.charAt(i)) {
first = j + 1;
stop = true;
break;
}
}
stepMax = stop ? (i - first + 1) : (stepMax + 1);
max = stepMax > max ? stepMax : max;
}
return max;
}
}
3. Longest Substring Without Repeating Characters
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。