refactor 421

fishercoder1534 · fishercoder1534 · commit a0d03cc22b8e · 2020-07-11T08:33:41.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_421.java b/src/main/java/com/fishercoder/solutions/_421.java
@@ -3,21 +3,6 @@
 import java.util.HashSet;
 import java.util.Set;
 
-/**
- * Given a non-empty array of numbers, a0, a1, a2, … , an-1, where 0 ≤ ai < 231.
-
- Find the maximum result of ai XOR aj, where 0 ≤ i, j < n.
-
- Could you do this in O(n) runtime?
-
- Example:
-
- Input: [3, 10, 5, 25, 2, 8]
-
- Output: 28
-
- Explanation: The maximum result is 5 ^ 25 = 28.
- */
 public class _421 {
 
     public static class Solution1 {
