LeetCode 304. Range Sum Query 2D - Immutable（线段树）

304. Range Sum Query 2D - Immutable

Medium

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

Range Sum Query 2D
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.

题意

给定一个矩阵，实现高效查找矩阵内各个块的元素和的算法

思路

二维线段树，实现方式和一维线段树基本一样。一维线段树参见博客：LeetCode 307. Range Sum Query - Mutable.

代码

class NumMatrix {
   
    private int m, n;
    private int[] tree;
    private int[][] matrix;
    
    private void buildTree(int root, int x1, int y1, int x2, int y2) {
   
        // System.out.println(root + " " + x1 + " " + y1 + " " + x2 + " " + y2);
        if (x1 == x2 && y1 == y2) {
   
            tree[root] = matrix[x1][y1];
            return;
        }
        if (x1 == x2) {
   
            buildTree(4*root+1, x1, y1, x1, (y1+y2)/2);
            buildTree(4*root+2, x1, (y1+y2)/2+1, x1