Stones on the Table

最新推荐文章于 2021-02-23 22:55:58 发布

圆***

最新推荐文章于 2021-02-23 22:55:58 发布

阅读量119

点赞数

分类专栏：刷题

本文链接：https://blog.csdn.net/c_h_e_e_r_y_saber/article/details/84886830

版权

刷题专栏收录该内容

18 篇文章 0 订阅

订阅专栏

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

问题链接https://vjudge.net/problem/CodeForces-266A

问题简述：随机输入RBG这三个字符，代表不同颜色的石子，数一下从中拿走的最小石头数，使相邻的两颗石头都有不同的颜色。

问题分析：定义一个字符数组，其中字符（RBG）代表石子，要从中取出最少的字符使得两两相邻字符不同，则一旦两两相邻的字符相同，就取出其中一个字符，设置s[j]和s[i]（i=j+1）为相邻两字符的前后，若相同，则取出的字符数sum++。

已AC的代码如下：

#include<iostream>
using namespace std;
int main()
{
	int n,i,j,sum=0;
	char s[100];
	cin >> n >> s;
	for (j=0,i = 1;i < n;i++,j++)
	{
		if (s[i] == s[j])//检测相邻两字符是否相同
		{
			sum++;
		}
	}
	cout<<sum;
}