Updated "Java Dequeue" problem.

galonge · May 28, 2018 · e188524 · e188524
1 parent bf26fc6
commit e188524
Showing 1 changed file with 6 additions and 0 deletions.
diff --git a/Java/Data Structures/Java Dequeue/Solution.java b/Java/Data Structures/Java Dequeue/Solution.java
@@ -41,6 +41,12 @@ public static void main(String[] args) {
             map.merge(num, 1, Integer::sum);
 
             max = Math.max(max, map.size());
+
+            /* If all integers are unique, we have found our largest
+               possible answer, so we can break out of loop */
+            if (max == m) {
+                break;
+            }
         }
 
         scan.close();