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
问题分析:
注意:题目中需要允许可以输入50个字符,但是要留出最后一个字符为‘\0’。
从左到右判断相邻的字符是否相等,如果不相等,sum++(sum初始值为0),最后判断完毕,输出n-sum-1(n为初始的字符个数)。
#include <iostream>
using namespace std;
int main()
{
int n, sum, i;
char c[51];
cin >> n;
while (n)
{
cin >> c;
sum = 0;
for (i = 0; i < (n - 1); i++)
{
if (c[i] != c[i + 1])
sum++;
}
cout << (n - 1 - sum) << endl;
}
return 0;
}