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

832. 翻转图像

class Solution {
public:
    vector<vector<int>> flipAndInvertImage(vector<vector<int>>& image) {
        vector<vector<int>> res=image;
        for(int i=0;i<image.size();i++)
        {
            for(int j=0;j<image[i].size();j++)
            {
                image[i][j]==0?image[i][j]=1:image[i][j]=0;
                res[i][image[i].size()-1-j]=image[i][j];
            }
        }
        return res;
    }
};

867. 转置矩阵

class Solution {
public:
    vector<vector<int>> transpose(vector<vector<int>>& matrix) {
        int m = matrix.size(), n = matrix[0].size();
        vector<vector<int>> res(n, vector<int>(m));
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                res[j][i] = matrix[i][j];
            }
        }
        return res;
    }
};

566. 重塑矩阵

class Solution {
public:
    vector<vector<int>> matrixReshape(vector<vector<int>>& mat, int r, int c) {
        vector<vector<int>>res;
        vector<int>ct;
        int n=mat.size(),m=mat[0].size(),cnt=0;
        if(r*c!=n*m) return mat;
        for(int i=0;i<n;i++) {
            for(int j=0;j<m;j++) {
                cnt++;
                ct.push_back(mat[i][j]);
                if(cnt==c) {
                    res.push_back(ct);
                    ct.clear();
                    cnt=0;
                }
            }
        }
        return res;
    }
};

2022. 将一维数组转变成二维数组

class Solution {
public:
    vector<vector<int>> construct2DArray(vector<int>& original, int m, int n) {
        vector<vector<int>>res;
        if(m*n!=original.size()) return res;
        vector<int>cnt;
        int num=0;
        for(int i=0;i<original.size();i++) {
            cnt.push_back(original[i]);
            num++;
            if(num==n) {
                res.push_back(cnt);
                cnt.clear();
                num=0;
            }
        } 
        return res;
    }
};

1260. 二维网格迁移

能暴力就不想（狗头）

class Solution {
public:
    vector<vector<int>> shiftGrid(vector<vector<int>>& grid, int k) {
        vector<int>res;
        for(int i=0;i<grid.size();i++) {
            for(int j=0;j<grid[0].size();j++) {
                res.push_back(grid[i][j]);
            }
        }
        int n=res.size();
        int ct=(10*n-k)%n;
        for(int i=0;i<grid.size();i++) {
            for(int j=0;j<grid[0].size();j++) {
                grid[i][j]=res[ct];
                ct=(ct+1)%n;
            }
        }
        return grid;
    }
};