Leetcode（三）-数组（一）-CSDN博客

本文链接：https://blog.csdn.net/googler_offer/article/details/99681007

思路：暴力

class Solution {
public:
    vector<vector<int>> generate(int numRows) {
        
        vector<vector<int>> res;
        for(int i=0;i<numRows;i++)
        {
            res.push_back(vector<int>(i+1,1));
            if(i>1)
            {
                for(int j=1;j<i;j++)
                {
                    res[i][j] = res[i-1][j-1]+res[i-1][j];
                }
            }
        }
        return res;
    }
};

832. 翻转图像

class Solution {
public:
    vector<vector<int>> flipAndInvertImage(vector<vector<int>>& A) {
        
        for(auto& line: A)
        {
            int size = line.size();
            for(int i=0;i<(size+1)/2;i++)
            {
                int tmp = line[i];
                line[i] = !line[size-i-1];
                line[size-i-1] = !tmp;
            }
        }
        return A;
    }
};

566. 重塑矩阵

class Solution {
public:
    vector<vector<int>> matrixReshape(vector<vector<int>>& nums, int r, int c) {
        
        int n = nums.size();
        int m = nums[0].size();
        if(r*c!=n*m) return nums;
        vector<vector<int>> res(r,vector<int>(c));
        for(int i=0;i<m*n;i++)
        {
            res[i/c][i%c] = nums[i/m][i%m];
        }
        return res;
    }
};

1013. 将数组分成和相等的三个部分

class Solution {
public:
    bool canThreePartsEqualSum(vector<int>& A) {
        
        int sum = 0;
        for(int i=0;i<A.size();i++)
            sum+=A[i];
        int divid = sum/3;
        int flag = 0;
        int tmp = 0;
        for(int i=0;i<A.size();i++)
        {
            tmp+=A[i];
            if(tmp==divid)
            {
                flag++;
                tmp = 0;
            }
        }
        return flag==3;
    }
};