Stones on the Table c++

题目

出处
There are n stones on the table in a row, each of them can be red, green or blue. Count the minimum number of stones to take from the table so that any two neighboring stones had different colors. Stones in a row are considered neighboring if there are no other stones between them.
Input
The first line contains integer n (1 ≤ n ≤ 50) — the number of stones on the table.

The next line contains string s, which represents the colors of the stones. We’ll consider the stones in the row numbered from 1 to n from left to right. Then the i-th character s equals “R”, if the i-th stone is red, “G”, if it’s green and “B”, if it’s blue.
Output
Print a single integer — the answer to the problem.

分析

桌子上有一排3种色的石头，问至少去掉多少个石头，才能使这一排的石头相邻颜色不同。
题意是输入石头的数量，再输入石头颜色顺序(字符串实现)。
思路：两两比较是否相同，如果是，则记数加1；否则不处理。这道题可以不用处理字符串，因为去掉石头后，后来的颜色顺序是不会改变的，所以保留原样就好了。
注意：要用getchar()去吸收 cin结束后的回车。

代码

#include<iostream>
using namespace std;
int main()
{
	int num, i,j;
	char stones[50];
	cin >> num;
	getchar();
	gets_s(stones, num+1);
	for (i = 1,j=0; i < num; i++)
	{
		if (stones[i - 1] == stones[i])j++;
	}
	cout << j<<endl;
	return 0;
}