edit 525

fishercoder1534 · fishercoder1534 · commit 56d304150b77 · 2017-05-17T08:24:30.000-07:00
diff --git a/README.md b/README.md
@@ -53,7 +53,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |530|[Minimum Absolute Difference in BST](https://leetcode.com/problems/minimum-absolute-difference-in-bst/)|[Solution](../master/src/main/java/com/stevesun/solutions/MinimumAbsoluteDifferenceinBST.java) | O(n) |O(n) | Easy| DFS
 |529|[Minesweeper](https://leetcode.com/problems/minesweeper/)|[Solution](../master/src/main/java/com/stevesun/solutions/Minesweeper.java) | O(m*n) |O(k) | Medium | BFS
 |526|[Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/)|[Solution](../master/src/main/java/com/stevesun/solutions/BeautifulArrangement.java) | O(n) |O(h) | Medium | Backtracking
-|525|[Contiguous Array](https://leetcode.com/problems/contiguous-array/)|[Solution](../master/src/main/java/com/stevesun/solutions/ContiguousArray.java) | O(n) |O(n) | Medium | HashMap
+|525|[Contiguous Array](https://leetcode.com/problems/contiguous-array/)|[Solution](../master/src/main/java/com/stevesun/solutions/_525.java) | O(n) |O(n) | Medium | HashMap
 |524|[Longest Word in Dictionary through Deleting](https://leetcode.com/problems/longest-word-in-dictionary-through-deleting/)|[Solution](../master/src/main/java/com/stevesun/solutions/_524.java) | O(n) |O(n) | Medium | Sort
 |523|[Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/)|[Solution](../master/src/main/java/com/stevesun/solutions/ContinuousSubarraySum.java) | O(n^2) |O(n) | Medium|
 |522|[Longest Uncommon Subsequence II](https://leetcode.com/problems/longest-uncommon-subsequence-ii/)|[Solution](../master/src/main/java/com/stevesun/solutions/LongestUncommonSubsequenceII.java) | O(x*n^2) (x is average length of strings)|O(1) | Medium|
diff --git a/src/main/java/com/stevesun/solutions/_525.java b/src/main/java/com/stevesun/solutions/_525.java
@@ -20,7 +20,7 @@
 
  Note: The length of the given binary array will not exceed 50,000.
  */
-public class ContiguousArray {
+public class _525 {
 
     //credit: https://leetcode.com/articles/contiguous-array/#approach-3-using-hashmap-accepted
     public int findMaxLength(int[] nums) {
diff --git a/src/test/java/com/stevesun/_525Test.java b/src/test/java/com/stevesun/_525Test.java
@@ -1,21 +1,20 @@
 package com.stevesun;
 
-import com.stevesun.solutions.ContiguousArray;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static junit.framework.Assert.assertEquals;
 
-public class ContiguousArrayTest {
-    private static ContiguousArray test;
+public class _525Test {
+    private static com.stevesun.solutions._525 test;
     private static int expected;
     private static int actual;
     private static int[] nums;
 
     @BeforeClass
     public static void setup(){
-        test = new ContiguousArray();
+        test = new com.stevesun.solutions._525();
     }
 
     @Before
