[LeetCode] 304. Range Sum Query 2D - Immutable

原题链接： https://leetcode.com/problems/range-sum-query-2d-immutable/

Range Sum专题相关题目

303. Range Sum Query - Immutable
304. Range Sum Query 2D - Immutable

1. 题目介绍

Given a 2D matrix matrix, find the sum of the elements inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2).

The above rectangle (with the red border) is defined by (row1, col1) = (2, 1) and (row2, col2) = (4, 3), which contains sum = 8.

给出一个矩阵和某个长方形的左上角和右下角的顶点坐标，求该长方形内的数字之和。

Example:

Given matrix = [
  [3, 0, 1, 4, 2],
  [5, 6, 3, 2, 1],
  [1, 2, 0, 1, 5],
  [4, 1, 0, 1, 7],
  [1, 0, 3, 0, 5]
]

sumRegion(2, 1, 4, 3) -> 8
sumRegion(1, 1, 2, 2) -> 11
sumRegion(1, 2, 2, 4) -> 12

Note:

You may assume that the matrix does not change.
There are many calls to sumRegion function.
You may assume that row1 ≤ row2 and col1 ≤ col2.

2. 解题思路

2.1 循环累加

直接按照循环累加的方式求和。
实现代码

class NumMatrix {

    int [][] m  = null;
	public  NumMatrix(int[][] matrix) {
		m = matrix;
    }
    
    public int sumRegion(int row1, int col1, int row2, int col2) {
        int ans = 0;
    	for(int i = row1;i<=row2;i++) {
        	for(int j = col1;j<=col2;j++) {
        		ans += m[i][j];
        	}
        }
    	return ans;
    }
}

/**
 * Your NumMatrix object will be instantiated and called as such:
 * NumMatrix obj = new NumMatrix(matrix);
 * int param_1 = obj.sumRegion(row1,col1,row2,col2);
 */

2.2 动态规划

构造二维数组dp，dp[ i ][ j ]中存放了左上角为（0 , 0)，右上角为（ i-1 ，j-1 ）的长方形内的数字和。
要求的答案可以直接利用dp数组进行计算。
ans = dp[row2+1][col2+1] - dp[row1][col2+1] - dp[row2+1][col1] + dp[row1][col1];

实现代码

class NumMatrix {

    int [][] dp = null;
	public NumMatrix(int[][] matrix) {
		int line = matrix.length;
		if(line == 0) return;
		
		int column = matrix[0].length;
		dp = new int [line+1][column+1];
		
		for(int i = 1;i<=line;i++ ) {
			for(int j = 1 ; j <=column;j++) {
				if( i==1 && j==1 ) {
					dp[i][j] = matrix[i-1][j-1];
				}
				else if (i == 1) {
					dp[i][j] = dp[i][j-1] + matrix[i-1][j-1];
				}
				else if(j == 1) {
					dp[i][j] = dp[i-1][j] + matrix[i-1][j-1];
				}
				else {
					dp[i][j] = dp[i-1][j] + dp[i][j-1] - dp[i-1][j-1] + matrix[i-1][j-1];
				}
			}
		}
    }
    
    public int sumRegion(int row1, int col1, int row2, int col2) {
    	
    	return dp[row2+1][col2+1] - dp[row1][col2+1] - dp[row2+1][col1] + dp[row1][col1];
    }
}

/**
 * Your NumMatrix object will be instantiated and called as such:
 * NumMatrix obj = new NumMatrix(matrix);
 * int param_1 = obj.sumRegion(row1,col1,row2,col2);
 */