edit 523

fishercoder1534 · fishercoder1534 · commit 276345f8dbb8 · 2017-07-24T13:37:13.000-07:00
diff --git a/README.md b/README.md
@@ -98,7 +98,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |526|[Beautiful Arrangement](https://leetcode.com/problems/beautiful-arrangement/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_526.java) | O(n) |O(h) | Medium | Backtracking
 |525|[Contiguous Array](https://leetcode.com/problems/contiguous-array/)|[Solution](../master/src/main/java/com/fishercoder/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/fishercoder/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/fishercoder/solutions/ContinuousSubarraySum.java) | O(n^2) |O(n) | Medium|
+|523|[Continuous Subarray Sum](https://leetcode.com/problems/continuous-subarray-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_523.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/fishercoder/solutions/LongestUncommonSubsequenceII.java) | O(x*n^2) (x is average length of strings)|O(1) | Medium|
 |521|[Longest Uncommon Subsequence I](https://leetcode.com/problems/longest-uncommon-subsequence-i/)|[Solution](../master/src/main/java/com/fishercoder/solutions/LongestUncommonSubsequenceI.java) | O(max(x,y)) (x and y are length of strings) |O(1) | Easy|
 |520|[Detect Capital](https://leetcode.com/problems/detect-capital/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_520.java) | O(n) |O(1) | Easy| 
diff --git a/src/main/java/com/fishercoder/solutions/_523.java b/src/main/java/com/fishercoder/solutions/_523.java
@@ -20,8 +20,8 @@
  You may assume the sum of all the numbers is in the range of a signed 32-bit integer.
 
  */
-public class ContinuousSubarraySum {
-    //TODO: could be optimized to O(n) time and O(k) space, reference: https://discuss.leetcode.com/topic/80793/java-o-n-time-o-k-space
+public class _523 {
+    /**TODO: could be optimized to O(n) time and O(k) space, reference: https://discuss.leetcode.com/topic/80793/java-o-n-time-o-k-space*/
 
     public boolean checkSubarraySum(int[] nums, int k) {
         if (nums == null || nums.length == 0) return false;
diff --git a/src/test/java/com/fishercoder/_523Test.java b/src/test/java/com/fishercoder/_523Test.java
@@ -1,22 +1,22 @@
 package com.fishercoder;
 
-import com.fishercoder.solutions.ContinuousSubarraySum;
+import com.fishercoder.solutions._523;
 import org.junit.Before;
 import org.junit.BeforeClass;
 import org.junit.Test;
 
 import static junit.framework.Assert.assertEquals;
 
-public class ContinuousSubarraySumTest {
-    private static ContinuousSubarraySum test;
+public class _523Test {
+    private static _523 test;
     private static boolean expected;
     private static boolean actual;
     private static int[] nums;
     private static int k;
 
     @BeforeClass
     public static void setup(){
-        test = new ContinuousSubarraySum();
+        test = new _523();
     }
 
     @Before
