Count number of times each letter occurs

[Caiz Austin]

Hi I'm trying to count how many times each letter occurs, but am only able to count the number of unique letters.
Sample input would is: ABBCCC
Sample output is: A = 1, B = 2, C = 3
This is what I have so far:

package twenty17;

import java.util.Scanner;

import java.util.HashMap;
import java.util.Map;

public class ProblemG {

    public static Scanner sc = new Scanner(System.in);

    public static void main(String[] args) {

        String input = sc.nextLine();
        char[] uniqueLetters;
        Map<Character, Integer> letterOccurrences = new HashMap<Character, Integer>();
        
         input = input.replaceAll("\\s", "");
        
        //find unique letterOccurrences by putting into hashmap
        for (int i = 0; i < input.length(); ++i) {
            if (!letterOccurrences.containsKey(input.charAt(i))) {
                letterOccurrences.put(input.charAt(i),0);
            }
            System.out.println(letterOccurrences);
        }
        uniqueLetters = new char[letterOccurrences.size()];

        //put each letter into uniqueLetters[] array
        for (int i = 0; i < letterOccurrences.size(); ++i) {
            uniqueLetters[i] = input.charAt(i);
            System.out.println(uniqueLetters[i]);
        }

        //count how many times a letter occurs
        for (int i = 0; i < uniqueLetters.length; i++) {

            if (letterOccurrences.containsKey(uniqueLetters[i])) {

                letterOccurrences.put(uniqueLetters[i], letterOccurrences.get(uniqueLetters[i]) + 1);
            } else {
                letterOccurrences.put(uniqueLetters[i], 1);
            }
        }
        System.out.println(letterOccurrences);
    }
}

[Tony Docherty]

Your code looks like the sort of code you get when you just start writing code without a real plan - it's far more convoluted and complicated than it needs to be. May I suggest you get a pen and paper and write out in plain text the steps you would take to solve the problem yourself and then look to convert that to code.

[Tony Docherty]

Just to add more detail to my suggestion, Here's 2 basic ways of solving this written in plain text.

1. Look at each letter in turn and if it's not in my results list add it to the list and then iterate across the rest of the string to count how many times that letter occurs and write down the total number of occurrences.
2. Look at each letter in turn and if it's not in my results list add it to the list with the number 1 next to it. If it is in the list add 1 to the number next to it.

[Ganesh Patekar]

Worth reading --> MainIsAPain

[Campbell Ritchie]

Another thing worth reading is the Java™ Tutorials. I won't tell you which section about Maps will be particularly helpful.