GoLang Solution For LeetCode Problem: Number of Submatrices That Sum to Target

Solving Number of Submatrices That Sum to Target in go. Please try yourself first to solve the problem and submit your implementation to LeetCode before looking into solution.

Problem Description

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. 1 <= matrix.length <= 300

2. 1 <= matrix[0].length <= 300

3. -1000 <= matrix[i] <= 1000

4. -10^8 <= target <= 10^8

5. 1 <= matrix.length <= 300

6. 1 <= matrix[0].length <= 300

7. -1000 <= matrix[i] <= 1000

8. -10^8 <= target <= 10^8

See the full details of the problem Number of Submatrices That Sum to Target at LeetCode

Originally posted at: @github.com/halfrost/LeetCode-Go