From b86b2072188813381927237233bd0d7d436f3930 Mon Sep 17 00:00:00 2001
From: kazusa <409053122@qq.com>
Date: Mon, 7 Jul 2025 11:54:56 +0800
Subject: [PATCH] =?UTF-8?q?local=20name=E6=B5=8B=E8=AF=95?=
MIME-Version: 1.0
Content-Type: text/plain; charset=UTF-8
Content-Transfer-Encoding: 8bit

---
 src/leecode/java/No3333.java | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

diff --git a/src/leecode/java/No3333.java b/src/leecode/java/No3333.java
index d860bfd..47f91e6 100644
--- a/src/leecode/java/No3333.java
+++ b/src/leecode/java/No3333.java
@@ -8,7 +8,7 @@ import java.util.List;
  * @date 2025/7/2 13:29
  */
 public class No3333 {
-
+    //
     public int possibleStringCount(String word, int k) {
         // 将原字符串转为数组，单字母连续出现的次数为数组中的元素，遇到一个新字母结算一个数组元素[]{a:3,b:3,a:4} {3,3,4}
         // k的最小值即为数组长度，记为m，即至少每个出现连续块的字母取一次