# Codeforces刷题之路——266A Stones on the Table

341人阅读 评论(0)

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 nfrom 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

import java.util.Scanner;

public class Main {

public static void main(String[] args) {
// TODO Auto-generated method stub
Scanner scanner = new Scanner(System.in);
int n = scanner.nextInt();
scanner.nextLine();
String str = scanner.nextLine();
char[] ch = str.toCharArray();

int counts = 0;
for(int i = 0;i < ch.length-1;i++){
if(ch[i] == ch[i+1]){
counts++;
}
}
System.out.println(counts);
scanner.close();
}
}

个人资料
等级：
访问量： 1万+
积分： 352
排名： 22万+
文章存档