Question

At input i have some string : “today snowing know ” , here i have 3 words , so i must to parse them is such way : every character i must compare with all other characters , and to sum how many same characters these words have , like exemple for “o” letter will be 2 (from “today” and “snowing”) or “w” letter will be 2 (from “know” and “snowing”). After that i must to replace these characters with number(transformed in char format) of letters. The result should be “13111 133211 1332”.

What i did ?

First i tape some words and

    public void inputStringsForThreads () {

       boolean flag;

            do {

    // will invite to input 
                stringToParse = Input.value();   

                try {

                flag = true;

    // in case that found nothing , space , number and other special character , throws an exception
                if (stringToParse.equals("") | stringToParse.startsWith(" ") | stringToParse.matches(".*[0-9].*") | stringToParse.matches(".*[~`!@#$%^&*()-+={};:',.<>?/'_].*"))

                    throw new MyStringException(stringToParse);

                else  analizeString(stringToParse);    
            }

            catch (MyStringException exception) {

                stringToParse = null;
                flag = false;
                exception.AnalizeException();  
            } 
          }
            while (!flag);
}

I eliminate spaces between words , and from those words make just one

   static void analizeString (String someString) {

// + sign treat many spaces as one
      String delimitator = " +";

// words is a String Array
      words = someString.split(delimitator);

// temp is a string , will contain a single word
      temp = someString.replaceAll("[^a-z^A-Z]","");


         System.out.println("=============== Words are : ===============");
      for (int i=0;i<words.length;i++)
          System.out.println((i+1)+")"+words[i]);
    }  

So i try to compare for every word in part (every word is split in letters) with all letter from all words , But i don know how to count number of same letter and after replace letters with correct number of each letter??? Any ideas ?

// this will containt characters for every word in part 
         char[] motot  =   words[id].toCharArray();

// this will containt all characters from all words     
         char[] notot = temp.toCharArray();


   for (int i =0;i<words[i].length();i++)

               for (int j=0;j<temp.length ;j++)

               {
                   if (i == j) {

                       System.out.println("Same word");

                   }

                   else   if (motot[i] == notot[j] ) {

                       System.out.println("Found equal :"+lol[i]+" "+lol1[j]);

                   }}

Answer 1

For counting you might want to use a Map<Character, Integer> counter like java.util.HashMap. If getting a Value(Integer) using a specific key (Character) from counter is ‘not null’, then your value++ (leverage autoboxing). Otherwise put a new entry (char, 1) in the counter.

Replacing the letters with the numbers should be fairly easy then.