modify code

Author: algorithmzuo

src/class048/Code01_PrefixSumMatrix.java

@@ -24,10 +24,10 @@ public NumMatrix(int[][] matrix) {
 			}
 		}
 
-		public int sumRegion(int row1, int col1, int row2, int col2) {
-			row2++;
-			col2++;
-			return sum[row2][col2] - sum[row2][col1] - sum[row1][col2] + sum[row1][col1];
+		public int sumRegion(int a, int b, int c, int d) {
+			c++;
+			d++;
+			return sum[c][d] - sum[c][b] - sum[a][d] + sum[a][b];
 		}
 
 	}

src/class048/Code04_DiffMatrixLuogu.java src/class048/Code03_DiffMatrixLuogu.javasrc/class048/Code04_DiffMatrixLuogu.java renamed to src/class048/Code03_DiffMatrixLuogu.java

@@ -13,15 +13,15 @@
 import java.io.PrintWriter;
 import java.io.StreamTokenizer;
 
-public class Code04_DiffMatrixLuogu {
+public class Code03_DiffMatrixLuogu {
 
 	public static int MAXN = 1002;
 
 	public static int[][] diff = new int[MAXN][MAXN];
 
 	public static int n, q;
 
-	public static void set(int a, int b, int c, int d, int k) {
+	public static void add(int a, int b, int c, int d, int k) {
 		diff[a][b] += k;
 		diff[c + 1][b] -= k;
 		diff[a][d + 1] -= k;
@@ -61,7 +61,7 @@ public static void main(String[] args) throws IOException {
 				c = (int) in.nval;
 				in.nextToken();
 				d = (int) in.nval;
-				set(a, b, c, d, 1);
+				add(a, b, c, d, 1);
 			}
 			build();
 			for (int i = 1; i <= n; i++) {

src/class048/Code03_DiffMatrixNowcoder.java

@@ -23,7 +23,7 @@ public class Code03_DiffMatrixNowcoder {
 
 	public static int n, m, q;
 
-	public static void set(int a, int b, int c, int d, int k) {
+	public static void add(int a, int b, int c, int d, int k) {
 		diff[a][b] += k;
 		diff[c + 1][b] -= k;
 		diff[a][d + 1] -= k;
@@ -59,7 +59,7 @@ public static void main(String[] args) throws IOException {
 			for (int i = 1; i <= n; i++) {
 				for (int j = 1; j <= m; j++) {
 					in.nextToken();
-					set(i, j, i, j, (int) in.nval);
+					add(i, j, i, j, (int) in.nval);
 				}
 			}
 			for (int i = 1, a, b, c, d, k; i <= q; i++) {
@@ -73,7 +73,7 @@ public static void main(String[] args) throws IOException {
 				d = (int) in.nval;
 				in.nextToken();
 				k = (int) in.nval;
-				set(a, b, c, d, k);
+				add(a, b, c, d, k);
 			}
 			build();
 			for (int i = 1; i <= n; i++) {

src/class048/Code05_StampingTheGrid.java src/class048/Code04_StampingTheGrid.javasrc/class048/Code05_StampingTheGrid.java renamed to src/class048/Code04_StampingTheGrid.java

@@ -10,7 +10,7 @@
 // 邮票不允许旋转，邮票必须完全在矩阵内
 // 如果在满足上述要求的前提下，可以放入邮票，请返回 true ，否则返回 false
 // 测试链接 : https://leetcode.cn/problems/stamping-the-grid/
-public class Code05_StampingTheGrid {
+public class Code04_StampingTheGrid {
 
 	public static boolean possibleToStamp(int[][] grid, int h, int w) {
 		int n = grid.length;
@@ -32,7 +32,7 @@ public static boolean possibleToStamp(int[][] grid, int h, int w) {
 			for (int b = 1, d = b + w - 1; d <= m; b++, d++) {
 				// (a,b) (c,d)
 				if (empty(sum, a, b, c, d)) {
-					set(diff, a, b, c, d);
+					add(diff, a, b, c, d);
 				}
 			}
 		}
@@ -60,7 +60,7 @@ public static boolean empty(int[][] sum, int a, int b, int c, int d) {
 		return sum[c][d] - sum[c][b - 1] - sum[a - 1][d] + sum[a - 1][b - 1] == 0;
 	}
 
-	public static void set(int[][] diff, int a, int b, int c, int d) {
+	public static void add(int[][] diff, int a, int b, int c, int d) {
 		diff[a][b] += 1;
 		diff[c + 1][d + 1] += 1;
 		diff[c + 1][b] -= 1;

…class048/Code06_StrongestForceField.java …class048/Code05_StrongestForceField.javasrc/class048/Code06_StrongestForceField.java renamed to src/class048/Code05_StrongestForceField.java src/class048/Code06_StrongestForceField.java renamed to src/class048/Code05_StrongestForceField.java

@@ -12,7 +12,7 @@
 // 请求出在这片地带中 力场强度 最强处的 力场强度
 // 注意：力场范围的边缘同样被力场覆盖。
 // 测试链接 : https://leetcode.cn/problems/xepqZ5/
-public class Code06_StrongestForceField {
+public class Code05_StrongestForceField {
 
 	public static int fieldOfGreatestBlessing(int[][] fields) {
 		int n = fields.length;
@@ -39,7 +39,7 @@ public static int fieldOfGreatestBlessing(int[][] fields) {
 			b = rank(ys, (y << 1) - r, sizey);
 			c = rank(xs, (x << 1) + r, sizex);
 			d = rank(ys, (y << 1) + r, sizey);
-			set(diff, a, b, c, d);
+			add(diff, a, b, c, d);
 		}
 		int ans = 0;
 		for (int i = 1; i < diff.length; i++) {
@@ -79,7 +79,7 @@ public static int rank(long[] nums, long v, int size) {
 	}
 
 	// 二维差分
-	public static void set(int[][] diff, int a, int b, int c, int d) {
+	public static void add(int[][] diff, int a, int b, int c, int d) {
 		diff[a][b] += 1;
 		diff[c + 1][d + 1] += 1;
 		diff[c + 1][b] -= 1;