root/notes
1
0
Fork 0
Code Issues Pull requests Actions Packages Projects Releases Wiki Activity

vault backup: 2022-07-14 10:09:31

Browse source
This commit is contained in:
juan 2022-07-14 10:09:31 +08:00
parent ae73cbe6b8
commit bbcd5e02d5
1 changed files with 3 additions and 0 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

3
OJ notes/pages/Leetcode Longest-Substring-Without-Repeating-Characters.md
View file

@ -69,6 +69,8 @@ similar to this one.
The goal is making cur as small as possible, without duplicating The goal is making cur as small as possible, without duplicating
And the localMax is max(localMax, i - cur)
### Solution ### Solution
Kadane's algorithm Kadane's algorithm
@ -90,6 +92,7 @@ public:
} }
hMap[s[i]] = i; hMap[s[i]] = i;
// The char at cur is ignored
localMax = max(localMax, i - cur); localMax = max(localMax, i - cur);
} }
return localMax; return localMax;