edit 370

Author: fishercoder1534

README.md

@@ -218,7 +218,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |373|[Find K Pairs with Smallest Sums](https://leetcode.com/problems/find-k-pairs-with-smallest-sums/)|[Solution](../master/src/main/java/com/fishercoder/solutions/FindKPairsWithSmallestSums.java)| O(?)|O(?) | Medium| Heap
 |372|[Super Pow](https://leetcode.com/problems/super-pow/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_372.java)| O(n)|O(1) | Medium| Math
 |371|[Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_371.java)| O(n)|O(1) | Easy| 
-|370|[Range Addition](https://leetcode.com/problems/range-addition/)|[Solution](../master/src/main/java/com/fishercoder/solutions/RangeAddition.java)| O(n+k)|O(1) | Medium| 
+|370|[Range Addition](https://leetcode.com/problems/range-addition/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_370.java)| O(n+k)|O(1) | Medium| 
 |369|[Plus One Linked List](https://leetcode.com/problems/plus-one-linked-list/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_369.java)| O(n)|O(1) | Medium| Linked List
 |368|[Largest Divisible Subset](https://leetcode.com/problems/largest-divisible-subset/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_368.java)| O(n^2)|O(n) | Medium| DP
 |367|[Valid Perfect Square](https://leetcode.com/problems/valid-perfect-square/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_367.java)| O(n)|O(1) | Medium| 

src/main/java/com/fishercoder/solutions/RangeAddition.java src/main/java/com/fishercoder/solutions/_370.java

@@ -39,7 +39,8 @@
  For each update operation, do you really need to update all elements between i and j?
  Update only the first and end element is sufficient.
  The optimal time complexity is O(k + n) and uses O(1) extra space.*/
-public class RangeAddition {
+
+public class _370 {
     /**Previously AC'ed brute force solution results in TLE now.*/
     public static int[] getModifiedArray_TLE(int length, int[][] updates) {
         int[] nums = new int[length];