From 1001ebf1f916c70aadf3e5a8228327503cf0d15a Mon Sep 17 00:00:00 2001
From: tom4649 <tkaaynakiyoshi@gmail.com>
Date: Thu, 16 Apr 2026 12:46:56 +0900
Subject: [PATCH] # 3. Longest Substring Without Repeating Characters

---
 .../__pycache__/sol2.cpython-310.pyc          | Bin 0 -> 694 bytes
 .../memo.md                                   |  24 ++++++++++++++++++
 .../sol1.py                                   |  21 +++++++++++++++
 .../sol2.py                                   |  12 +++++++++
 4 files changed, 57 insertions(+)
 create mode 100644 3.Longest-Substring-Without-Repeating-Characters/__pycache__/sol2.cpython-310.pyc
 create mode 100644 3.Longest-Substring-Without-Repeating-Characters/memo.md
 create mode 100644 3.Longest-Substring-Without-Repeating-Characters/sol1.py
 create mode 100644 3.Longest-Substring-Without-Repeating-Characters/sol2.py

diff --git a/3.Longest-Substring-Without-Repeating-Characters/__pycache__/sol2.cpython-310.pyc b/3.Longest-Substring-Without-Repeating-Characters/__pycache__/sol2.cpython-310.pyc
new file mode 100644
index 0000000000000000000000000000000000000000..ffd6f1d1b34e0bfa0681eee536aa238e7eee7522
GIT binary patch
literal 694
zcmZ`%&5qMB5cXfv5beThwSqk$5aQHB8wsu}v{I3{pdxLBKoQ6awcAD{PS<wOf}B(L
z#!J8rUdbmUPJIO~Fm88IIWX2YnVI;T8IRrU@23dl+ruB_XN=I#;Oq(o=M-QLK|MnP
z3494yksJv!L47)f_&>tHI|Z0~pd`w%KsgauQb8n}F+l~pWO*baV8=e0G*xTMMtN*}
ztfg(Wni61MO9Dm&7y-;{P$lXhT}J`TB8OM_DSCVV4e6pTcH|3ou^?Yb*K<8b-$(kc
z>j`=Xb<{<UxcCHF;uzTU7=`$XbnHBJ44Pr%HKa%D-ymz41su-bkgBbvF0Ax)F0H3^
zanVmaGqRfL&}N=ig|WO;LSFdD*h1Spg-yJYYHk;vN+ohKU3j+C^22weZvyGpS@zOM
zZ8F=`<)YAKR#(}m5v7`EkB842HJ8Q?Cha?8HN*z5O1o%UJ2;a|S=bO60jrqWki#_9
zqv7(SKi*b+F}vdbrH3}n5h#YkI>384*{mb*K0Ua;fZ_l6<8V!!tD=^i`;_y#5p5Oh
zJ<iYDqPqG+p<7Q&W%U6R+Z=R9-3qZV)c_M7NrG<UO=R5Pes^|<Dd|A*$;r0dlMOGN
H<q-V=#;UCk

literal 0
HcmV?d00001

diff --git a/3.Longest-Substring-Without-Repeating-Characters/memo.md b/3.Longest-Substring-Without-Repeating-Characters/memo.md
new file mode 100644
index 0000000..12c692c
--- /dev/null
+++ b/3.Longest-Substring-Without-Repeating-Characters/memo.md
@@ -0,0 +1,24 @@
+# 3. Longest Substring Without Repeating Characters
+
+- sol1.py: 自力で解いたが、テストの途中を print するなどデバッグして答えを合わせた
+
+コメント集
+- https://github.com/olsen-blue/Arai60/pull/49#discussion_r2005295464
+> seen_char_to_index.get(s[right], -1) と使えば、条件分岐を回避できますね。
+
+
+
+知らなかった（勉強したことはある気がする）が、初期の実装がこのアルゴリズムになっていた
+- 尺取法
+    - https://qiita.com/drken/items/ecd1a472d3a0e7db8dce
+- sliding window
+    - https://qiita.com/rumblekat03/items/4edd9dd4607280c994d1
+
+
+https://github.com/mamo3gr/arai60/blob/3_longest-substring-without-repeating-characters/3_longest-substring-without-repeating-characters/memo.md
+
+> char_to_index.get(c, -1) として条件分岐をなくす (step2). コードとしてはすっきりするけど、読み手からしたらシミュレートの手間が増えそう。
+
+という考えもあるのか。
+
+sol2.py: 他の人のコードとコメントを参考にもう一度書き直す
diff --git a/3.Longest-Substring-Without-Repeating-Characters/sol1.py b/3.Longest-Substring-Without-Repeating-Characters/sol1.py
new file mode 100644
index 0000000..ebff081
--- /dev/null
+++ b/3.Longest-Substring-Without-Repeating-Characters/sol1.py
@@ -0,0 +1,21 @@
+class Solution:
+    def lengthOfLongestSubstring(self, s: str) -> int:
+        if not s:
+            return 0
+        seen_char_to_idx = {}
+        start = 0
+        max_length = 0
+        last = start + 1
+        seen_char_to_idx[s[start]] = start
+        while start < len(s):
+            while last < len(s) and s[last] not in seen_char_to_idx:
+                seen_char_to_idx[s[last]] = last
+                last += 1
+            max_length = max(max_length, last - start)
+            if last >= len(s):
+                break
+            start = max(seen_char_to_idx[s[last]] + 1, start)
+            seen_char_to_idx[s[last]] = last
+            last += 1
+
+        return max_length
diff --git a/3.Longest-Substring-Without-Repeating-Characters/sol2.py b/3.Longest-Substring-Without-Repeating-Characters/sol2.py
new file mode 100644
index 0000000..b5b0fc9
--- /dev/null
+++ b/3.Longest-Substring-Without-Repeating-Characters/sol2.py
@@ -0,0 +1,12 @@
+class Solution:
+    def lengthOfLongestSubstring(self, s: str) -> int:
+        last_index = {}
+        start = 0
+        max_length = 0
+        for end, ch in enumerate(s):
+            prev = last_index.get(ch, -1)
+            if prev >= start:
+                start = prev + 1
+            last_index[ch] = end
+            max_length = max(max_length, end - start + 1)
+        return max_length