LeetCode – Range Sum Query 2D – Immutable (Java)

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).


Since the assumption is that there are many calls to sumRegion method, we should use some extra space to store the intermediate results.

The solution is similar to other sum related problems such as . The basic idea is demonstrated in the following example:

Here we define an array sum[][] which stores the sum value from (0,0) to the current cell.

Java Solution

public class NumMatrix {
    int [][] sum;
    public NumMatrix(int[][] matrix) {
        if(matrix==null || matrix.length==0||matrix[0].length==0)
        int m = matrix.length;
        int n = matrix[0].length;
        sum = new int[m][n];
        for(int i=0; i<m; i++){
            int sumRow=0;
            for(int j=0; j<n; j++){
                    sumRow += matrix[i][j];
                    sumRow += matrix[i][j];
    public int sumRegion(int row1, int col1, int row2, int col2) {
            return 0;
        int topRightX = row1;
        int topRightY = col2;
        int bottomLeftX=row2;
        int bottomLeftY= col1;
        int result=0;
        if(row1==0 && col1==0){
            result = sum[row2][col2];
        }else if(row1==0){
            result = sum[row2][col2]
        }else if(col1==0){
            result = sum[row2][col2]
            result = sum[row2][col2]
        return result;
Category >> Algorithms  
If you want someone to read your code, please put the code inside <pre><code> and </code></pre> tags. For example:
String foo = "bar";