'commit'

TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/6.cpp

@@ -12,7 +12,7 @@ int cnt = 1;
 // 递归写法
 void dfs(string s) {
     int p;
-    for (p = s.size() - 1; p; p--)
+    for (p = s.size() - 1; p >= 1; p--)
         if (s[0] != s[p]) break;
 
     string t;

TangDou/LanQiaoBei/ZhongGaoJi/LanQiao15STEMA202401/6_while.cpp

@@ -1,33 +0,0 @@
-#include <bits/stdc++.h>
-using namespace std;
-
-/*
-测试用例：
-5
-12321
-
-*/
-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 = s.substr(1, p);
-        if (t.size())
-            cnt++, s = t;
-        else
-            break;
-    }
-}
-
-int main() {
-    int n;
-    string s;
-    cin >> n >> s;
-    cut(s);
-    cout << cnt << endl;
-    return 0;
-}