update 1314

Author: fishercoder1534

src/main/java/com/fishercoder/solutions/secondthousand/_1314.java

@@ -5,14 +5,17 @@
 
 public class _1314 {
     public static class Solution1 {
-        public int[][] matrixBlockSum(int[][] mat, int K) {
+        /**
+         * This is a brute force solution without using prefix sum. i.e. lots of repeated computation.
+         */
+        public int[][] matrixBlockSum(int[][] mat, int k) {
             int m = mat.length;
             int n = mat[0].length;
             int[][] answer = new int[m][n];
             for (int i = 0; i < m; i++) {
                 for (int j = 0; j < n; j++) {
-                    List<Integer> iRange = findRange(i, K, m);
-                    List<Integer> jRange = findRange(j, K, n);
+                    List<Integer> iRange = findRange(i, k, m);
+                    List<Integer> jRange = findRange(j, k, n);
                     int sum = 0;
                     for (int ii = 0; ii < iRange.size(); ii++) {
                         for (int jj = 0; jj < jRange.size(); jj++) {

src/test/java/com/fishercoder/secondthousand/_1314Test.java

@@ -1,18 +1,18 @@
 package com.fishercoder.secondthousand;
 
 import com.fishercoder.solutions.secondthousand._1314;
-import org.junit.BeforeClass;
-import org.junit.Test;
+import org.junit.jupiter.api.BeforeEach;
+import org.junit.jupiter.api.Test;
 
-import static org.junit.Assert.assertEquals;
+import static org.junit.jupiter.api.Assertions.assertEquals;
 
 public class _1314Test {
     private static _1314.Solution1 solution1;
     private static int[][] mat;
     private static int[][] expected;
 
-    @BeforeClass
-    public static void setup() {
+    @BeforeEach
+    public void setup() {
         solution1 = new _1314.Solution1();
     }