package com.ctc.iasms.base.region.action;
import java.util.ArrayList;
import java.util.List;
public class FindMostTimes {
/**
* 方法描述:
* @param args
* @author: Administrator
* @date: 2012-5-14 下午02:50:16
*/
public static void main(String[] args) {
char c = findMostTimes("aaccccdddddddd");
System.out.println(c);
}
public static char findMostTimes(String str){
char[] strChar = str.toCharArray();
int countNum = 0;
List<Integer> numList = new ArrayList<Integer>();
List<Character> charList = new ArrayList<Character>();
for(int i=0;i < strChar.length; i++){
for(int j = i;j < strChar.length;j++){
char c = strChar[i];
if(c == strChar[j]){
countNum++;
}
}
numList.add(countNum);
charList.add(strChar[i]);
if(countNum >numList.get(0)){
numList.remove(0);
numList.add(countNum);
charList.remove(0);
charList.add(strChar[i]);
}
countNum = 0;
}
return charList.get(0);
}
}
import java.util.ArrayList;
import java.util.List;
public class FindMostTimes {
/**
* 方法描述:
* @param args
* @author: Administrator
* @date: 2012-5-14 下午02:50:16
*/
public static void main(String[] args) {
char c = findMostTimes("aaccccdddddddd");
System.out.println(c);
}
public static char findMostTimes(String str){
char[] strChar = str.toCharArray();
int countNum = 0;
List<Integer> numList = new ArrayList<Integer>();
List<Character> charList = new ArrayList<Character>();
for(int i=0;i < strChar.length; i++){
for(int j = i;j < strChar.length;j++){
char c = strChar[i];
if(c == strChar[j]){
countNum++;
}
}
numList.add(countNum);
charList.add(strChar[i]);
if(countNum >numList.get(0)){
numList.remove(0);
numList.add(countNum);
charList.remove(0);
charList.add(strChar[i]);
}
countNum = 0;
}
return charList.get(0);
}
}
本文介绍了一个Java程序,该程序能够找出给定字符串中出现次数最多的字符,并通过一个具体的例子进行了演示。
254

被折叠的 条评论
为什么被折叠?



