304. Range Sum Query 2D - Immutable
package LeetCode_304 /** * 304. Range Sum Query 2D - Immutable * https://leetcode.com/problems/range-sum-query-2d-immutable/ * Given a 2D matrix matrix, handle multiple queries of the following type: Calculate the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2). Implement the NumMatrix class: NumMatrix(int[][] matrix) Initializes the object with the integer matrix matrix. int sumRegion(int row1, int col1, int row2, int col2) Returns the sum of the elements of matrix inside the rectangle defined by its upper left corner (row1, col1) and lower right corner (row2, col2). Example 1: Input ["NumMatrix", "sumRegion", "sumRegion", "sumRegion"] [[[ [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]]], [2, 1, 4, 3], [1, 1, 2, 2], [1, 2, 2, 4]] Output [null, 8, 11, 12] Explanation NumMatrix numMatrix = new NumMatrix([[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]]); numMatrix.sumRegion(2, 1, 4, 3); // return 8 (i.e sum of the red rectangle) numMatrix.sumRegion(1, 1, 2, 2); // return 11 (i.e sum of the green rectangle) numMatrix.sumRegion(1, 2, 2, 4); // return 12 (i.e sum of the blue rectangle) * */ class NumMatrix(matrix: Array<IntArray>) { /* * solution: dp, Time and Space complexity are:O(m*n) * */ var sums: Array<IntArray>? = null var m = 0 var n = 0 init { m = matrix.size n = matrix[0].size sums = Array(m + 1) { IntArray(n + 1) } for (i in 1..m) { for (j in 1..n) { //sums[i][j] represent the sum of range from matrix[0][0] to matrix[i][j] sums!![i][j] = sums!![i][j - 1] + sums!![i - 1][j] - sums!![i - 1][j - 1] + matrix[i - 1][j - 1] } } } fun sumRegion(row1: Int, col1: Int, row2: Int, col2: Int): Int { return sums!![row2 + 1][col2 + 1] - sums!![row1][col2 + 1] - sums!![row2 + 1][col1] + sums!![row1][col1] } } /** * Your NumMatrix object will be instantiated and called as such: * var obj = NumMatrix(matrix) * var param_1 = obj.sumRegion(row1,col1,row2,col2) */
【推荐】国内首个AI IDE,深度理解中文开发场景,立即下载体验Trae
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步
· AI与.NET技术实操系列(二):开始使用ML.NET
· 记一次.NET内存居高不下排查解决与启示
· 探究高空视频全景AR技术的实现原理
· 理解Rust引用及其生命周期标识(上)
· 浏览器原生「磁吸」效果!Anchor Positioning 锚点定位神器解析
· DeepSeek 开源周回顾「GitHub 热点速览」
· 物流快递公司核心技术能力-地址解析分单基础技术分享
· .NET 10首个预览版发布:重大改进与新特性概览!
· AI与.NET技术实操系列(二):开始使用ML.NET
· .NET10 - 预览版1新功能体验(一)