魔镜项链：最小长度计算

#include #include using namespace std;

int main() { string necklace; cin >> necklace;

int n = necklace.size();
int minLen = n;
for (int i = 0; i < n; i++) {
    if (necklace[i] != necklace[0]) {
        minLen = n;
        break;
    }
    if (necklace[i] == necklace[(i + 1) % n]) {
        minLen = min(minLen, n - i - 1);
    }
}

cout << minLen << endl;

return 0;

}