Skip to content

Commit b4a5266

Browse files
authored
Merge pull request neetcode-gh#640 from diss1993/ticket/33
Swift | 3-Longest-Substring-Without-Repeating-Characters.swift
2 parents 1cd8740 + b337e61 commit b4a5266

File tree

1 file changed

+19
-0
lines changed

1 file changed

+19
-0
lines changed
Lines changed: 19 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,19 @@
1+
class Solution {
2+
func lengthOfLongestSubstring(_ s: String) -> Int {
3+
guard s.count > 0 else { return 0 }
4+
let list = Array(s)
5+
var hs = Set<Character>()
6+
var l = 0
7+
var r = 0
8+
var mv = 0
9+
for r in 0..<s.count {
10+
while hs.contains(list[r]) {
11+
hs.remove(list[l])
12+
l += 1
13+
}
14+
hs.insert(list[r])
15+
mv = max(mv, r - l + 1)
16+
}
17+
return mv
18+
}
19+
}

0 commit comments

Comments
 (0)
pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy