8000
We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 829b8f1 commit 08ff86aCopy full SHA for 08ff86a
Chapter_01/P01_CountDuplicateCharacters/src/modern/challenge/Main.java
@@ -46,7 +46,7 @@ public static void main(String[] args) {
46
System.out.println("HashMap based solution:");
47
long startTimeV3 = System.nanoTime();
48
49
- Map<String, Long&g 5624 t; duplicatesV3 = Strings.countDuplicateCharactersVCP1(TEXT_CP);
+ Map<String, Integer> duplicatesV3 = Strings.countDuplicateCharactersVCP1(TEXT_CP);
50
51
displayExecutionTime(System.nanoTime()-startTimeV3);
52
System.out.println(Arrays.toString(duplicatesV3.entrySet().toArray()));
0 commit comments