1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 |
package practice; import java.util.HashMap; import java.util.Map; import java.util.Scanner; import java.util.Set; public class RepeatingCharacters { public static void main(String[] args) { Scanner sc= new Scanner(System.in); String val= sc.next(); Map<Character, Integer> amap = new HashMap<Character, Integer>(); int count = 1; for (int i = 0; i < val.length(); i++) { if (!amap.containsKey(val.charAt(i))) { count = 1; } amap.put(val.charAt(i), count); count++; } try { Set<Map.Entry<Character, Integer>> set = amap.entrySet(); for (Map.Entry<Character, Integer> entry : set) { System.out.println(entry.getKey() + " = " + entry.getValue()); //Please debug the code for better understanding } sc.close(); } catch (Exception e) { e.printStackTrace(); sc.close(); } } } |
1 2 3 4 5 6 7 8 9 |
programming p = 1 a = 1 r = 2 g = 2 i = 1 m = 2 n = 1 o = 1 |