From c23d05c11a6b276c271f0f1fab759c9fa079b14b Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?=E9=BB=84=E6=B5=B7?= <10402852@qq.com>
Date: Tue, 12 Mar 2024 20:19:04 +0800
Subject: [PATCH] 'commit'

---
 .../LanQiao15STEMA202401/{6.cpp => 6_dfs.cpp} |  0
 .../LanQiao15STEMA202401/6_while.cpp          | 37 +++++++++++++++++++
 2 files changed, 37 insertions(+)
 rename TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/{6.cpp => 6_dfs.cpp} (100%)
 create mode 100644 TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/6_while.cpp

diff --git a/TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/6.cpp b/TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/6_dfs.cpp
similarity index 100%
rename from TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/6.cpp
rename to TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/6_dfs.cpp
diff --git a/TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/6_while.cpp b/TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/6_while.cpp
new file mode 100644
index 0000000..dc8a299
--- /dev/null
+++ b/TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/6_while.cpp
@@ -0,0 +1,37 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+/*
+测试用例：
+5
+12321
+
+思路：
+1、先看前后是不是存在一样的，这样的优先处理
+2、
+*/
+int cnt = 1;
+
+// 循环写法
+void cut(string s) {
+    while (true) {
+        int p;
+        for (p = s.size() - 1; p; p--)
+            if (s[0] != s[p]) break;
+        string t;
+        for (int i = 1; i <= p; i++) t += s[i];
+        if (t.size())
+            cnt++, s = t;
+        else
+            break;
+    }
+}
+
+int main() {
+    int n;
+    string s;
+    cin >> n >> s;
+    cut(s);
+    cout << cnt << endl;
+    return 0;
+}
\ No newline at end of file