update

AnghelLeonard · AnghelLeonard · commit 3a7d00c46863 · 2019-08-25T09:40:35.000+03:00
diff --git a/Chapter_01/P01_CountDuplicateCharacters/src/modern/challenge/Main.java b/Chapter_01/P01_CountDuplicateCharacters/src/modern/challenge/Main.java
@@ -46,7 +46,7 @@ public static void main(String[] args) {
         System.out.println("HashMap based solution:");
         long startTimeV3 = System.nanoTime();
         
-        Map<String, Integer> duplicatesV3 = Strings.countDuplicateCharactersVCP1(TEXT_CP);
+        Map<String, Long> duplicatesV3 = Strings.countDuplicateCharactersVCP1(TEXT_CP);
         
         displayExecutionTime(System.nanoTime()-startTimeV3);
         System.out.println(Arrays.toString(duplicatesV3.entrySet().toArray()));
diff --git a/Chapter_01/P01_CountDuplicateCharacters/src/modern/challenge/Strings.java b/Chapter_01/P01_CountDuplicateCharacters/src/modern/challenge/Strings.java
@@ -20,8 +20,8 @@ public static Map<Character, Integer> countDuplicateCharactersV1(String str) {
 
         Map<Character, Integer> result = new HashMap<>();                
 
+        // or use for(char ch: str.toCharArray()) { ... }
         for (int i = 0; i < str.length(); i++) {
-
             char ch = str.charAt(i);
 
             result.compute(ch, (k, v) -> (v == null) ? 1 : ++v);
