edit 327

fishercoder1534 · fishercoder1534 · commit 70d741eec2f7 · 2017-07-24T13:40:19.000-07:00
diff --git a/README.md b/README.md
@@ -259,7 +259,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |330|[Patching Array](https://leetcode.com/problems/patching-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_330.java)| O(m+logn)|O(1) | Hard| Greedy
 |329|[Longest Increasing Path in a Matrix](https://leetcode.com/problems/longest-increasing-path-in-a-matrix/)|[Solution](../master/src/main/java/com/fishercoder/solutions/LongestIncreasingPathInAMatrix.java)| O(?)|O(?) | Hard|
 |328|[Odd Even Linked List](https://leetcode.com/problems/odd-even-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_328.java)| O(n)|O(1) | Medium| Linked List
-|327|[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/CountOfRangeSum.java)| O(?)|O(?) | Hard|
+|327|[Count of Range Sum](https://leetcode.com/problems/count-of-range-sum/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_327.java)| O(?)|O(?) | Hard|
 |325|[Maximum Size Subarray Sum Equals k](https://leetcode.com/problems/maximum-size-subarray-sum-equals-k/)|[Solution] | O(n)|O(n) | Medium| HashMap
 |324|[Wiggle Sort II](https://leetcode.com/problems/wiggle-sort-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_324.java)| O(n)|O(n) | Medium| Sort
 |323|[Number of Connected Components in an Undirected Graph](https://leetcode.com/problems/number-of-connected-components-in-an-undirected-graph/)|[Solution](../master/src/main/java/com/fishercoder/solutions/NumberOfConnectedComponentsInAnUndirectedGraph.java)| O(?)|O(?)| Medium|
diff --git a/src/main/java/com/fishercoder/solutions/_327.java b/src/main/java/com/fishercoder/solutions/_327.java
@@ -12,7 +12,7 @@ A naive algorithm of O(n2) is trivial. You MUST do better than that.
  Return 3.
  The three ranges are : [0, 0], [2, 2], [0, 2] and their respective sums are: -2, -1, 2.
  */
-public class CountOfRangeSum {
+public class _327 {
 
     public int countRangeSum(int[] nums, int lower, int upper) {
         int n = nums.length;
