405.Submatrix Sum-和为零的子矩阵（中等题）

和为零的子矩阵

1. 题目

   给定一个整数矩阵，请找出一个子矩阵，使得其数字之和等于0.输出答案时，请返回左上数字和右下数字的坐标。

2. 样例

   给定矩阵
   
   返回 [(1,1), (2,2)]

3. 挑战

   O(n^3) 时间复杂度。

4. 题解

public class Solution {
    /**
     * @param matrix an integer matrix
     * @return the coordinate of the left-up and right-down number
     */
    public int[][] submatrixSum(int[][] matrix) {
        int[][] result = new int[2][2];
        int M = matrix.length;
        if (M == 0) 
        {
            return result;
        }
        int N = matrix[0].length;
        if (N == 0) 
        {
            return result;
        }
        int[][] sum = new int[M+1][N+1];
        for (int j=0; j<=N; ++j) sum[0][j] = 0;
        for (int i=1; i<=M; ++i) sum[i][0] = 0;
        for (int i=0; i<M; ++i) 
        {
            for (int j=0; j<N; ++j)
            {
                sum[i+1][j+1] = matrix[i][j] + sum[i+1][j] + sum[i][j+1] - sum[i][j];
            }
        }
        for (int l=0; l<M; ++l) 
        {
            for (int h=l+1; h<=M; ++h) 
            {
                Map<Integer, Integer> map = new HashMap<Integer, Integer>();
                for (int j=0; j<=N; ++j) 
                {
                    int diff = sum[h][j] - sum[l][j];
                    if (map.containsKey(diff)) 
                    {
                        int k = map.get(diff);
                        result[0][0] = l;   result[0][1] = k;
                        result[1][0] = h-1; result[1][1] = j-1;
                        return result;
                    } 
                    else 
                    {
                        map.put(diff, j);
                    }
                }
            }
        }
        return result;
    }
}

Last Update 2016.11.16