add solution 1074,1476,1535,1552,1588

Author: LjyYano

solution/1000-1099/1074.Number of Submatrices That Sum to Target/Solution.java

@@ -0,0 +1,31 @@
+class Solution {
+    public int numSubmatrixSumTarget(int[][] matrix, int target) {
+        int row = matrix.length, col = matrix[0].length;
+        int[][] sum = new int[row][col];
+        int ans = 0;
+        for (int i = 0; i < row; i++) {
+            for (int j = 0; j < col; j++) {
+                if (i == 0 && j == 0) {
+                    sum[i][j] = matrix[i][j];
+                } else if (i == 0) {
+                    sum[i][j] = matrix[i][j] + sum[i][j - 1];
+                } else if (j == 0) {
+                    sum[i][j] = matrix[i][j] + sum[i - 1][j];
+                } else {
+                    sum[i][j] = matrix[i][j] - sum[i - 1][j - 1] + sum[i - 1][j] + sum[i][j - 1];
+                }
+                for (int k = 0; k <= i; k++) {
+                    for (int l = 0; l <= j; l++) {
+                        int main = (k != 0 && l != 0) ? sum[k - 1][l - 1] : 0;
+                        int left = k != 0 ? sum[k - 1][j] : 0;
+                        int up = l != 0 ? sum[i][l - 1] : 0;
+                        if (sum[i][j] - left - up + main == target) {
+                            ans++;
+                        }
+                    }
+                }
+            }
+        }
+        return ans;
+    }
+}

solution/1400-1499/1476.Subrectangle Queries/Solution.java

@@ -0,0 +1,35 @@
+class SubrectangleQueries {
+
+    int[][] matrix;
+
+    public SubrectangleQueries(int[][] rectangle) {
+        matrix = new int[rectangle.length][rectangle[0].length];
+        for (int i = 0; i < rectangle.length; i++) {
+            for (int j = 0; j < rectangle[0].length; j++) {
+                matrix[i][j] = rectangle[i][j];
+            }
+        }
+    }
+
+    public void updateSubrectangle(int row1, int col1, int row2, int col2, int newValue) {
+        if (row1 > row2 || col1 > col2) {
+            return;
+        }
+        for (int i = row1; i <= row2; i++) {
+            for (int j = col1; j <= col2; j++) {
+                matrix[i][j] = newValue;
+            }
+        }
+    }
+
+    public int getValue(int row, int col) {
+        return matrix[row][col];
+    }
+}
+
+/**
+ * Your SubrectangleQueries object will be instantiated and called as such:
+ * SubrectangleQueries obj = new SubrectangleQueries(rectangle);
+ * obj.updateSubrectangle(row1,col1,row2,col2,newValue);
+ * int param_2 = obj.getValue(row,col);
+ */

solution/1500-1599/1535.Find the Winner of an Array Game/Solution.java

@@ -0,0 +1,17 @@
+class Solution {
+    public int getWinner(int[] arr, int k) {
+        int time = 0, max = arr[0];
+        for (int i = 1; i < arr.length; i++) {
+            if (max > arr[i]) {
+                time++;
+            } else {
+                time = 1;
+                max = arr[i];
+            }
+            if (time >= k) {
+                return max;
+            }
+        }
+        return max;
+    }
+}

solution/1500-1599/1552.Magnetic Force Between Two Balls/Solution.java

@@ -0,0 +1,35 @@
+class Solution {
+    public int maxDistance(int[] position, int m) {
+        Arrays.sort(position);
+        // 最小磁力的可能最小值
+        int min = 1;
+        // 最小磁力的可能最大值
+        int max = (position[position.length - 1] - position[0]) / (m - 1);
+        int ans = -1;
+        while (min <= max) {
+            int mid = (min + max) / 2;
+            if (checkDistance(mid, position, m)) {
+                ans = mid;
+                min = mid + 1;
+            } else {
+                max = mid - 1;
+            }
+        }
+        return ans;
+    }
+
+    private boolean checkDistance(int mid, int[] position, int m) {
+        int count = 1;
+        int pre = position[0];
+        for (int i = 1; i < position.length; i++) {
+            if (position[i] - pre >= mid) {
+                count++;
+                if (count >= m) {
+                    return true;
+                }
+                pre = position[i];
+            }
+        }
+        return false;
+    }
+}

solution/1500-1599/1588.Sum of All Odd Length Subarrays/Solution.java

@@ -0,0 +1,18 @@
+class Solution {
+    public int sumOddLengthSubarrays(int[] arr) {
+        int[] sum = new int[arr.length];
+        for (int i = 0; i < arr.length; i++) {
+            sum[i] = (i != 0 ? sum[i - 1] : 0) + arr[i];
+        }
+        int ans = 0;
+        // sum[b] - sum[a] 为 (a,b] 的和
+        for (int i = 0; i < arr.length; i++) {
+            ans += arr[i];
+            for (int j = i + 2; j < arr.length; j += 2) {
+                // [i, j]
+                ans += sum[j] - sum[i] + arr[i];
+            }
+        }
+        return ans;
+    }
+}