algorithm/LeetCode-Go
1
0
Fork 0
mirror of https://github.com/halfrost/LeetCode-Go.git synced 2025-07-07 09:54:57 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update solution 3

Browse Source
This commit is contained in:
halfrost
2022-01-10 21:21:21 +08:00
parent 4c3088b02a
commit bf40f42476
2 changed files with 10 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files

9
leetcode/0003.Longest-Substring-Without-Repeating-Characters/3. Longest Substring Without Repeating Characters.go
View File

@ -31,15 +31,16 @@ func lengthOfLongestSubstring1(s string) int {
if len(s) == 0 { if len(s) == 0 {
return 0 return 0
} }
var freq [256]int var freq [127]int
result, left, right := 0, 0, -1 result, left, right := 0, 0, -1
for left < len(s) { for left < len(s) {
if right+1 < len(s) && freq[s[right+1]-'a'] == 0 { if right+1 < len(s) && freq[s[right+1]] == 0 {
freq[s[right+1]-'a']++ freq[s[right+1]]++
right++ right++
} else { } else {
freq[s[left]-'a']-- freq[s[left]]--
left++ left++
} }
result = max(result, right-left+1) result = max(result, right-left+1)

9
website/content/ChapterFour/0001~0099/0003.Longest-Substring-Without-Repeating-Characters.md
View File

@ -86,15 +86,16 @@ func lengthOfLongestSubstring1(s string) int {
if len(s) == 0 { if len(s) == 0 {
return 0 return 0
} }
var freq [256]int var freq [127]int
result, left, right := 0, 0, -1 result, left, right := 0, 0, -1
for left < len(s) { for left < len(s) {
if right+1 < len(s) && freq[s[right+1]-'a'] == 0 { if right+1 < len(s) && freq[s[right+1]] == 0 {
freq[s[right+1]-'a']++ freq[s[right+1]]++
right++ right++
} else { } else {
freq[s[left]-'a']-- freq[s[left]]--
left++ left++
} }
result = max(result, right-left+1) result = max(result, right-left+1)