A. Stones on the Table

A. Stones on the Table

time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output

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

问题链接：A. Stones on the Table

问题简述：

输入一组球的个数，和每个球的颜色。求至少需要拿走几个球，使相同颜色的球不放在一起。

问题分析：

转换问题，求有多少个两边颜色相同的间隙。

程序说明：

本程序利用for循环一个个找相同的球，若前后两个球相同，则加一。

AC通过的C语言程序如下：

    #include "stdafx.h"
    #include<iostream>
    using namespace std;
    
    int main()
    {
    	int n;
    	cin >> n;
    	char a[50];
    	cin >> a;
    	int k = 0;
    	for (int i = 0; i < n - 1; i++)
    	{
    		if (a[i] == a[i + 1])k++;
    	}
    	cout << k << endl;
    	return 0;
    }