edit 303

fishercoder1534 · fishercoder1534 · commit 29986b041bfb · 2017-07-24T18:34:44.000-07:00
diff --git a/README.md b/README.md
@@ -283,7 +283,7 @@ Your ideas/fixes/algorithms are more than welcome!
 |306|[Additive Number](https://leetcode.com/problems/additive-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_306.java)| O(n^2) | O(n) | Medium|
 |305|[Number of Islands II](https://leetcode.com/problems/number-of-islands-ii/)|[Solution](../master/src/main/java/com/fishercoder/solutions/NumberofIslandsII.java)| ? | ? | Hard| Union Find
 |304|[Range Sum Query 2D - Immutable](https://leetcode.com/problems/range-sum-query-2d-immutable/)|[Solution](../master/src/main/java/com/fishercoder/solutions/RangeSumQuery2DImmutable.java)| ? | ? |Medium| 
-|303|[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)|[Solution](../master/src/main/java/com/fishercoder/solutions/RangeSumQueryImmutable.java)| O(n) | O(1) |Easy|
+|303|[Range Sum Query - Immutable](https://leetcode.com/problems/range-sum-query-immutable/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_303.java)| O(n) | O(1) |Easy|
 |302|[Smallest Rectangle Enclosing Black Pixels](https://leetcode.com/problems/smallest-rectangle-enclosing-black-pixels/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_302.java)| ? | O(m*n) | Hard| DFS, BFS
 |301|[Remove Invalid Parentheses](https://leetcode.com/problems/remove-invalid-parentheses/)|[Solution](../master/src/main/java/com/fishercoder/solutions/RemoveInvalidParentheses.java)| ? | ? | Hard| BFS
 |300|[Longest Increasing Subsequence](https://leetcode.com/problems/longest-increasing-subsequence/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_300.java)| O(logn)|O(n) | Medium| DP
diff --git a/src/main/java/com/fishercoder/solutions/_303.java b/src/main/java/com/fishercoder/solutions/_303.java
@@ -11,31 +11,28 @@
  Note:
  You may assume that the array does not change.
  There are many calls to sumRange function.*/
-public class RangeSumQueryImmutable {
-
-    
-}
-
-class NumArray {
-    int[] sums;
-    public NumArray(int[] nums) {
-        sums = new int[nums.length];
-        for(int i = 0; i < nums.length; i++){
-            if(i == 0){
-                sums[i] = nums[i];
-            } else {
-                sums[i] = sums[i-1] + nums[i];
+public class _303 {
+    class NumArray {
+        int[] sums;
+
+        public NumArray(int[] nums) {
+            sums = new int[nums.length];
+            for (int i = 0; i < nums.length; i++) {
+                if (i == 0) {
+                    sums[i] = nums[i];
+                } else {
+                    sums[i] = sums[i - 1] + nums[i];
+                }
             }
         }
-    }
 
-    public int sumRange(int i, int j) {
-        if(i == 0) return sums[j];
-        return sums[j] - sums[i-1];
+        public int sumRange(int i, int j) {
+            if (i == 0) return sums[j];
+            return sums[j] - sums[i - 1];
+        }
     }
 }
 
-
 // Your NumArray object will be instantiated and called as such:
 // NumArray numArray = new NumArray(nums);
 // numArray.sumRange(0, 1);
