1
给定一个由数字组成的字符串,如:“1239586838923173478943890234092”,统计
出每个数字出现的次数。
public class Test2 {
static int s0 = 0, s1 = 0, s2 = 0, s3 = 0, s4 = 0, s5 = 0, s6 = 0, s7 = 0,
s8 = 0, s9 = 0;//类变量,共享
public static void main(String[] args) {
String str = "1239586838923173478943890234092";
for (int i = 0; i < str.length(); i++) {
tongji(str.charAt(i));//根据索引截取字符,然后调用统计函数
}
System.out.println("0有" + s0 + "个," + "1有" + s1 + "个," + "2有" + s2
+ "个," + "3有" + s3 + "个," + "4有" + s4 + "个," + "5有" + s5 + "个,"
+ "6有" + s6 + "个," + "7有" + s7 + "个," + "8有" + s8 + "个," + "9有"
+ s9 + "个,");
}
public static void tongji(char str) {
switch (str) {//判断字符
case '0':s0++;break;
case '1':s1++;break;
case '2':s2++;break;
case '3':s3++;break;
case '4':s4++;break;
case '5':s5++;break;
case '6':s6++;break;
case '7':s7++;break;
case '8':s8++;break;
case '9':s9++;break;
}
}
}
2
定义一个StringBuffer类对象:
1)使用append方法向对象中添加26个字母,并倒序遍历输出
2)删除前五个字符
public class Test3 {
public static void main(String[] args) {
StringBuffer str=new StringBuffer();//创建StringBuffer对象
for(int i=65;i<=90;i++){//65到90大写的 97到122小写
str.append((char)(i));//添加字符到str尾部
}
System.out.println(str);
for(int j=str.length()-1;j>=0;j--){//遍历
System.out.print(str.charAt(j));//输出字符
}
System.out.println();
str.delete(0, 4);//删除前五个字符
System.out.println(str);
}
}