计算字符串中特定字符出现的次数——Java版,具体实现请看程序:
1.
public
class CharCount1 {
public static void main(String []args){
int s = count( "helloworld",'l');
System.out.println(s);
}
public static int count(String str, char c){
int k=0;
for( int i=0;i<str.length();i++){
if(str.charAt(i)==c)
k++;
}
return k;
}
}
public static void main(String []args){
int s = count( "helloworld",'l');
System.out.println(s);
}
public static int count(String str, char c){
int k=0;
for( int i=0;i<str.length();i++){
if(str.charAt(i)==c)
k++;
}
return k;
}
}
2.
public
class CharCount2 {
public static int chCount2( char c, String s) {
int k=0, i=0;
while (i < s.length()) {
i = s.indexOf(c, i);
if (i < 0)
return k;
k++; i++;
}
return k;
}
public static void main(String args[]) {
String s = "abccba";
int l1 = chCount2('a',s);
int l2 = chCount2('c', s);
System.out.println(s+ " " + l1 + " " + l2);
}
}
public static int chCount2( char c, String s) {
int k=0, i=0;
while (i < s.length()) {
i = s.indexOf(c, i);
if (i < 0)
return k;
k++; i++;
}
return k;
}
public static void main(String args[]) {
String s = "abccba";
int l1 = chCount2('a',s);
int l2 = chCount2('c', s);
System.out.println(s+ " " + l1 + " " + l2);
}
}
转载于:https://blog.51cto.com/tscjsj/85332