format

fishercoder1534 · fishercoder1534 · commit 0ac8ad4d79de · 2017-07-26T19:05:05.000-07:00
diff --git a/README.md b/README.md
@@ -407,7 +407,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |167|[Two Sum II - Input array is sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_167.java)| O(logn)|O(1) | Easy|
 |166|[Fraction to Recurring Decimal](https://leetcode.com/problems/fraction-to-recurring-decimal/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_166.java) | O(1) |O(1) | Medium| HashMap
 |165|[Compare Version Numbers](https://leetcode.com/problems/compare-version-numbers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_165.java)| O(n)|O(1) | Easy|
-|164|[Maximum Gap](https://leetcode.com/problems/maximum-gap/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MaximumGap.java) | O(n) |O(n) | Hard|
+|164|[Maximum Gap](https://leetcode.com/problems/maximum-gap/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_164.java) | O(n) |O(n) | Hard|
 |163|[Missing Ranges](https://leetcode.com/problems/missing-ranges/)|[Solution](../master/src/main/java/com/fishercoder/solutions/MissingRanges.java) | O(n) |O(1) | |
 |162|[Find Peak Element](https://leetcode.com/problems/find-peak-element/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_162.java) | O(1) |O(logn)/O(n) | Binary Search|
 |161|[One Edit Distance](https://leetcode.com/problems/one-edit-distance/)|[Solution](../master/src/main/java/com/fishercoder/solutions/OneEditDistance.java) | O(n) |O(1) | |
diff --git a/src/main/java/com/fishercoder/solutions/_164.java b/src/main/java/com/fishercoder/solutions/_164.java
@@ -4,14 +4,11 @@
 
 /**
  * Given an unsorted array, find the maximum difference between the successive elements in its sorted form.
- * <p>
  * Try to solve it in linear time/space.
- * <p>
  * Return 0 if the array contains less than 2 elements.
- * <p>
  * You may assume all elements in the array are non-negative integers and fit in the 32-bit signed integer range.
  */
-public class MaximumGap {
+public class _164 {
     //brute force
     public int maximumGap(int[] nums) {
         if (nums.length < 2) return 0;
diff --git a/src/test/java/com/fishercoder/_164Test.java b/src/test/java/com/fishercoder/_164Test.java
@@ -1,21 +1,21 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.MaximumGap;
+import com.fishercoder.solutions._164;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static junit.framework.Assert.assertEquals;
 
-public class MaximumGapTest {
-    private static MaximumGap test;
+public class _164Test {
+    private static _164 test;
     private static int expected;
     private static int actual;
     private static int[] nums;
 
     @BeforeClass
     public static void setup(){
-        test = new MaximumGap();
+        test = new _164();
     }
 
     @Before
