codeforces 163 Div2 A

好久不更了 我错了QAQ

A. Stones on the Table time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard 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.

Sample test(s) input 3RRG output 1 input 5RRRRR output 4 input 4BRBG output 0

 

水。。计算字符串里 连续的相同字符数个数

代码：

1 #include<iostream> 2 3 using namespace std; 4 5 int main( void) 6 { 7 char colour, pre=0; 8 int count=0; 9 int amount, i; 10 cin>>amount; 11 for( i=0; i<amount; i++) 12 { 13 cin>>colour; 14 if(colour==pre) 15 count++; 16 pre=colour; 17 } 18 cout<<count; 19 cout<<endl; 20 return 0; 21 }

 

转载于:https://www.cnblogs.com/shadow-justice/archive/2013/02/13/2911007.html

相关资源：JAVA上百实例源码以及开源项目