Stones on the Table
Problem Description
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.
Examples
Input
3
RRG
Output
1
Input
5
RRRRR
Output
4
Input
4
BRBG
Output
0
问题简述：判断n块石头中有多少个相同的颜色相邻摆放；
问题分析：输入字符，判断相邻两个字符是否相同；
程序说明：输入字符，利用字符数组判断两个相邻字符是否相同，并用a累加计数；
AC通过的C++语言程序如下：
#include
using namespace std;
int main()
{
int n, k = 0, a = 0;
cin >> n;
char ch, s[50];
cin.get();
while ((ch=cin.get()) != ‘\n’)
{
s[k++] = ch;
}
for (int i = 0; i<k; i++)
{
if (s[i] == s[i + 1])
a++;
}
cout << a;
}