《LeetCode零基础指南》(第九讲) 二级指针

1.832. 翻转图像

class Solution {
    public int[][] flipAndInvertImage(int[][] image) {
       for(int i = 0; i < image.length; i++){
           int n = image[i].length - 1;
           for(int j = 0; j <= n; j++,n--){
               if(image[i][j] != image[i][n]){
                   continue;
               }else {
                   if(image[i][j] == 0){
                       image[i][j] = image[i][n] = 1;
                   }else {
                       image[i][j] = image[i][n] = 0;
                   }
               }
           } 
       }
       return image;
    }
}

2.867. 转置矩阵

/*
1.给你一个二维整数数组 matrix， 返回 matrix 的 转置矩阵 
2.矩阵的 转置 是指将矩阵的主对角线翻转，交换矩阵的行索引与列索引。 */
class Solution {
    public int[][] transpose(int[][] matrix) {
        int n = matrix.length;//行
        int m = matrix[0].length;//列
        int [][] arr = new int [m][n];
        for(int i = 0; i < n; i++){
            for(int j = 0; j < m; j++){
                arr[j][i] = matrix[i][j];
            }
        }
        return arr;
    }
}

3.1314. 矩阵区域和

class Solution {
    public int[][] matrixBlockSum(int[][] mat, int K) {
     int[][] res = new int[mat.length][mat[0].length];
        for (int i = 0; i < mat.length; i++) {
            for (int j = 0; j < mat[0].length; j++) {
                int sum = 0;
                for (int r = Math.max(i - K, 0); r <= Math.min(i + K, mat.length - 1); r++) {
                    for (int c = Math.max(j - K, 0); c <= Math.min(j + K, mat[0].length - 1); c++) {
                        sum += mat[r][c];
                    }
                }
                res[i][j] = sum;
            }
        }
        return res;
    }
}