1074. Number of Submatrices That Sum to Target

最新推荐文章于 2021-08-13 02:30:34 发布

无差别刷题

最新推荐文章于 2021-08-13 02:30:34 发布

阅读量558

点赞数

文章标签： presum array

本文链接：https://blog.csdn.net/wilzxu/article/details/90746272

版权

1074. Number of Submatrices That Sum to Target

方法1:
- 易错点：
- Complexity

Given a matrix, and a target, return the number of non-empty submatrices that sum to target.

A submatrix x1, y1, x2, y2 is the set of all cells matrix[x][y] with x1 <= x <= x2 and y1 <= y <= y2.

Two submatrices (x1, y1, x2, y2) and (x1’, y1’, x2’, y2’) are different if they have some coordinate that is different: for example, if x1 != x1’.

Example 1:

Input: matrix = [[0,1,0],[1,1,1],[0,1,0]], target = 0
Output: 4
Explanation: The four 1x1 submatrices that only contain 0.
Example 2:

Input: matrix = [[1,-1],[-1,1]], target = 0
Output: 5
Explanation: The two 1x2 submatrices, plus the two 2x1 submatrices, plus the 2x2 submatrix.

Note:

1 <= matrix.length <= 300
1 <= matrix[0].length <= 300
-1000 <= matrix[i] <= 1000
-10^8 <= target <= 10^8

方法1:

参考第363. Max Sum of Rectangle No Larger Than K。

易错点：

set是在每一对l r 都要更新，且要首先插入一个0。
res += hash[sum - target]，因为之前可能有多个长方形j满足sum[i] - sum[j] = target。

Complexity

Time complexity: O(n^2 * m)。
Space complexity: O(m)，rowsum和hash大小，这里可以取mn两者较小值。

class Solution {
public:
    int numSubmatrixSumTarget(vector<vector<int>>& matrix, int target) {
        int m = matrix.size(), n = matrix[0].size(), res = 0;
        for (int l = 0; l < n; l++) {
            vector<int> rowsum(m, 0);
            for (int r = l; r < n; r++) {
                int sum = 0;
                unordered_map<int, int> hash;
                hash[0] = 1;
                for (int i = 0; i < m ; i++) {
                    rowsum[i] += matrix[i][r];
                    sum += rowsum[i];
                    if (hash.find(sum - target) != hash.end()) res += hash[sum - target];
                    hash[sum]++;
                }
            }
        }
        return res;
    }
};

另一种先求出prefix sum matrix的方法，取代了之前滚动求rowsum的过程，没什么大区别。

class Solution {
public:
    int numSubmatrixSumTarget(vector<vector<int>>& matrix, int target) {
        int m = matrix.size(), n = matrix[0].size(), res = 0;
        vector<vector<int>> presum(m, vector<int>(n, 0));
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < n; j++) {
                cout << i << "i" << j << "j" << endl;
                presum[i][j] = matrix[i][j] + ((j == 0) ? 0 : presum[i][j - 1] );
            }
        }
        
        for (int l = 0; l < n; l++) {
            for (int r = l; r < n; r++) {
                vector<int> rowsum(m, 0);
                unordered_map<int, int> hash;
                hash[0] = 1;
                int sum = 0;
                for (int i = 0; i < m; i++) {
                    rowsum[i] = presum[i][r] - ((l == 0) ? 0 : presum[i][l - 1]);
                    sum += rowsum[i];
                    if (hash.find(sum - target) != hash.end()) res += hash[sum - target];
                    hash[sum]++;
                }
            }
        }
        return res;
    }
};