diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/number_submatrices_sum_target.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/number_submatrices_sum_target.cpp')
-rw-r--r-- | other/number_submatrices_sum_target.cpp | 24 |
1 files changed, 0 insertions, 24 deletions
diff --git a/other/number_submatrices_sum_target.cpp b/other/number_submatrices_sum_target.cpp deleted file mode 100644 index db5a84f..0000000 --- a/other/number_submatrices_sum_target.cpp +++ /dev/null @@ -1,24 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - int numSubmatrixSumTarget(vector<vector<int>> &matrix, int target) { - int xLen = matrix[0].size(), yLen = matrix.size(), ans = 0; - unordered_map<int, int> res; - for (int i = 0; i < yLen; i++) - for (int j = 1; j < xLen; j++) - matrix[i][j] += matrix[i][j - 1]; - for (int j = 0; j < xLen; j++) - for (int k = j; k < xLen; k++) { - res.clear(); - res[0] = 1; - int cSum = 0; - for (int i = 0; i < yLen; i++) { - cSum += matrix[i][k] - (j ? matrix[i][j - 1] : 0); - ans += res.find(cSum - target) != res.end() ? res[cSum - target] : 0; - res[cSum]++; - } - } - return ans; - } -}; |