refactor 304

fishercoder1534 · fishercoder1534 · commit 7140bda0a1bc · 2020-05-28T18:25:24.000-07:00
diff --git a/src/main/java/com/fishercoder/solutions/_304.java b/src/main/java/com/fishercoder/solutions/_304.java
@@ -1,30 +1,5 @@
 package com.fishercoder.solutions;
 
-/**
- * 304. Range Sum Query 2D - Immutable
- *
- * Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).
-
- Range Sum Query 2D
- The above rectangle (with the red border) is defined by (row1, col1) = (2, 1) and (row2, col2) = (4, 3), which contains sum = 8.
-
- Example:
- Given matrix = [
- [3, 0, 1, 4, 2],
- [5, 6, 3, 2, 1],
- [1, 2, 0, 1, 5],
- [4, 1, 0, 1, 7],
- [1, 0, 3, 0, 5]
- ]
-
- sumRegion(2, 1, 4, 3) -> 8
- sumRegion(1, 1, 2, 2) -> 11
- sumRegion(1, 2, 2, 4) -> 12
- Note:
- You may assume that the matrix does not change.
- There are many calls to sumRegion function.
- You may assume that row1 ≤ row2 and col1 ≤ col2.
- */
 public class _304 {
 
     public static class Solution1 {
@@ -40,14 +15,14 @@ public NumMatrix(int[][] matrix) {
                 for (int i = 0; i < matrix.length; i++) {
                     for (int j = 0; j < matrix[0].length; j++) {
                         tot[i + 1][j + 1] =
-                            matrix[i][j] + tot[i + 1][j] + tot[i][j + 1] - tot[i][j];
+                                matrix[i][j] + tot[i + 1][j] + tot[i][j + 1] - tot[i][j];
                     }
                 }
             }
 
             public int sumRegion(int row1, int col1, int row2, int col2) {
                 return tot[row2 + 1][col2 + 1] - tot[row2 + 1][col1] - tot[row1][col2 + 1]
-                    + tot[row1][col1];
+                        + tot[row1][col1];
             }
 
             int[][] tot;
