Register
|
Login
Home
News
Competitions
Practice
How to
Rankings
Calendar
Arena
CodeFu 2007
CodeFu'07 Highlights
Jazoon'07 Highlights
Schedule
Rules
Prizes
Results
Competitions
»
Main CodeFu Competitons
»
CodeFu 2007
»
Results
CodeFu 2007 Results
CodeFu Final Round Results
Iterator's solution for 100: Most Used Character, written in Java
import java.util.HashMap; import java.util.Hashtable; public class MostUsedCharacter { public static String mostUsed(String sentence) { char bukvi[]= new char[26]; bukvi[0] = 'a'; bukvi[1] = 'b'; bukvi[2] = 'c'; bukvi[3] = 'd'; bukvi[4] = 'e'; bukvi[5] = 'f'; bukvi[6] = 'g'; bukvi[7] = 'h'; bukvi[8] = 'i'; bukvi[9] = 'j'; bukvi[10] = 'k'; bukvi[11] = 'l'; bukvi[12] = 'm'; bukvi[13] = 'n'; bukvi[14] = 'o'; bukvi[15] = 'p'; bukvi[16] = 'q'; bukvi[17] = 'r'; bukvi[18] = 's'; bukvi[19] = 't'; bukvi[20] = 'u'; bukvi[21] = 'v'; bukvi[22] = 'w'; bukvi[23] = 'x'; bukvi[24] = 'y'; bukvi[25] = 'z'; int niza[] = new int[26]; boolean test[] = new boolean[26]; for(int s=0;s<26;s++){ test[s] = false; } String[] zborovi = sentence.split(" "); for(int k=0;k<zborovi.length;k++){ for(int s=0;s<26;s++){ test[s] = false; } for(int j=0;j<zborovi[k].length();j++){ for(int i=0;i<26;i++){ if(bukvi[i] == zborovi[k].charAt(j)){ if(!test[i]){ niza[i]++; test[i] = true; } }//end if }//end i }//end for }//end k int max = niza[0]; int maxindex = 0; for(int i=1;i<26;i++){ if(niza[i]>max){max = niza[i];maxindex = i;} } char trt[] = new char[1]; trt[0] = bukvi[maxindex]; return new String(trt); } public static void main(String[] args) { // TODO Auto-generated method stub System.out.println(mostUsed("d d d d c c c c x x x x b b b b")); } }