refactor 303

fishercoder1534 · fishercoder1534 · commit fe3c343032dd · 2018-12-10T07:46:39.000-08:00
diff --git a/src/main/java/com/fishercoder/solutions/_303.java b/src/main/java/com/fishercoder/solutions/_303.java
@@ -1,18 +1,22 @@
 package com.fishercoder.solutions;
 
-/**Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
+/**
+ * 303. Range Sum Query - Immutable
+ * Given an integer array nums, find the sum of the elements between indices i and j (i ≤ j), inclusive.
 
  Example:
  Given nums = [-2, 0, 3, -5, 2, -1]
 
  sumRange(0, 2) -> 1
  sumRange(2, 5) -> -1
  sumRange(0, 5) -> -3
+
  Note:
  You may assume that the array does not change.
- There are many calls to sumRange function.*/
+ There are many calls to sumRange function.
+ */
 public class _303 {
-    class NumArray {
+    public static class NumArray {
         int[] sums;
 
         public NumArray(int[] nums) {
