g0001_0100.s0003_longest_substring_without_repeating_characters.Solution Maven / Gradle / Ivy
Go to download
Show more of this group Show more artifacts with this name
Show all versions of leetcode-in-java17 Show documentation
Show all versions of leetcode-in-java17 Show documentation
Java Solution for LeetCode algorithm problems, continually updating
package g0001_0100.s0003_longest_substring_without_repeating_characters;
// #Medium #Top_100_Liked_Questions #Top_Interview_Questions #String #Hash_Table #Sliding_Window
public class Solution {
public int lengthOfLongestSubstring(String s) {
int[] lastIndices = new int[256];
for (int i = 0; i < 256; i++) {
lastIndices[i] = -1;
}
int maxLen = 0;
int curLen = 0;
int start = 0;
for (int i = 0; i < s.length(); i++) {
char cur = s.charAt(i);
if (lastIndices[cur] < start) {
lastIndices[cur] = i;
curLen++;
} else {
int lastIndex = lastIndices[cur];
start = lastIndex + 1;
curLen = i - start + 1;
lastIndices[cur] = i;
}
if (curLen > maxLen) {
maxLen = curLen;
}
}
return maxLen;
}
}