一个由小写字母组成的字符串可以看成一些同一字母的最大碎片组成的。例如,"aaabbaaac"是由下面碎片组成的:'aaa','bb','c'。牛牛现在给定一个字符串,请你帮助计算这个字符串的所有碎片的平均长度是多少。
输入包括一个字符串s,字符串s的长度length(1 ≤ length ≤ 50),s只含小写字母('a'-'z')
输出一个整数,表示所有碎片的平均长度,四舍五入保留两位小数。 如样例所示: s = "aaabbaaac" 所有碎片的平均长度 = (3 + 2 + 3 + 1) / 4 = 2.25
aaabbaaac
2.25
public class Main{ public static void main(String[]args){ Scanner sc = new Scanner(System.in); while(sc.hasNext()){ String str = sc.nextLine(); List<Integer> list = new ArrayList<>(); int count = 1; for(int i=0; i< str.length()-1; i++){ char c = str.charAt(i); if(str.charAt(i+1) == c) count++; else{ list.add(count); count =1; } } list.add(count); int sum =0, length = list.size(); for(int i =0; i < length; i++){ sum+=list.get(i); } return sum/length; } } }
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
String s = in.next();
in.close();
char[] c = s.toCharArray();
char a = c[0];
int n = 1;
float f;
for(int i = 1; i < c.length ; i++){
if(a != c[i]){
a = c[i];
n++;
}
}
f = (float)c.length / n;
System.out.println(String.format("%.2f", f));
}
}
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner scan = new Scanner(System.in);
while (scan.hasNext()) {
String str = scan.nextLine();
List<Integer> list = new ArrayList<>();
int count = 1;
for (int i = 0; i < str.length() - 1; i++) {
char temp = str.charAt(i);
if (str.charAt(i + 1) == temp) {
count++;
} else {
list.add(count);
count = 1;
}
}
list.add(count);
int sum = 0, length = list.size();
for (int i = 0; i < length; i++) {
sum += list.get(i);
}
double averLength = (double) sum / length;
System.out.printf("%.2f", averLength);
}
}
}