C++ 齿轮问题解法：静态数组实现 - GearsDiv2

#include #include

using namespace std;

int main() { int n; cin >> n;

char gears[50];
cin >> gears;

int count = 0;

for (int i = 0; i < n; i++) {
    if (gears[i] == 'L' && gears[(i+1)%n] == 'R') {
        count++;
    }
    else if (gears[i] == 'R' && gears[(i+1)%n] == 'L') {
        count++;
    }
}

cout << count << endl;

return 0;

}