zoukankan      html  css  js  c++  java
  • 304. Range Sum Query 2D

    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)
     */
  • 相关阅读:
    第三章 套接字编程简介
    Effective STL 学习关于容器
    C++单例模板
    第六章 IO复用:select和poll函数
    第五章 TCP客户服务器程序示例
    八、基本UDP套接字编程
    第四章 基本TCP套接字编程
    测试 LaTeX
    如何在不支持 LaTeX 的环境使用 LaTeX 命令输入公式?
    Ubuntu 下 Wine 安装微软 Office
  • 原文地址:https://www.cnblogs.com/johnnyzhao/p/15076840.html
Copyright © 2011-2022 走看看