leetcode: finished #395

content/leetcode/2024/1.md

@@ -3,6 +3,30 @@ title: 2024.1
 draft: false
 ---
 
+# 2024.1.13
+
+```python
+#
+# @lc app=leetcode.cn id=395 lang=python3
+#
+# [395] 至少有 K 个重复字符的最长子串
+#
+
+
+# @lc code=start
+class Solution:
+    def longestSubstring(self, s: str, k: int) -> int:
+        if len(s) < k:
+            return 0
+        for c in set(s):
+            if s.count(c) < k:
+                return max(self.longestSubstring(t, k) for t in s.split(c))
+        return len(s)
+
+
+# @lc code=end
+```
+
 # 2024.1.12
 
 ```python