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

    传送门

    04. Range Sum Query 2D - Immutable

       My Submissions
    Total Accepted: 12544 Total Submissions: 56503 Difficulty: 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:

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

    Subscribe to see which companies asked this question

    Hide Tags
     Dynamic Programming
    Show Similar Problems
     
     

    Submission Details

    12 / 12 test cases passed.
    Status: 

    Accepted

    Runtime: 24 ms

    思路:动态规划

     
     1 class NumMatrix {
     2 public:
     3     NumMatrix(vector<vector<int>> &matrix) {
     4         if(matrix.empty()){
     5             return;
     6         }
     7         int n = matrix.size(), m = matrix[0].size();
     8         sums = vector<vector<int>>(n+1, vector<int>(m+1, 0));
     9         int i,j;
    10         sums[0][0] = matrix[0][0];
    11         for(i = 1;i <= n;i++){
    12             for(j = 1;j <= m;j++){
    13                 sums[i][j] = sums[i - 1][j] + sums[i][j - 1] - sums[i - 1][j - 1] + matrix[i -1][j - 1];
    14             }
    15         }
    16     }
    17 
    18     int sumRegion(int row1, int col1, int row2, int col2) {
    19         return sums[row2 + 1][col2 + 1] - sums[row1][col2 + 1] - sums[row2 + 1][col1] + sums[row1][col1];
    20     }
    21 
    22 private:    
    23     vector<vector<int>> sums;
    24 };
    25 
    26 
    27 // Your NumMatrix object will be instantiated and called as such:
    28 // NumMatrix numMatrix(matrix);
    29 // numMatrix.sumRegion(0, 1, 2, 3);
    30 // numMatrix.sumRegion(1, 2, 3, 4);
  • 相关阅读:
    笨方法学python笔记
    Orchard CMS 单点解决方案(SSO)及两种身份认证模块的介绍
    Orchard Oauth身份认证模块,在原基础上支持百度,豆瓣,开心,QQ,人人,新浪,淘宝
    凉鞋
    第一天
    网络编程vc++、socket机制
    定时器
    界面的多语言切换/通过读取xml文件实现
    svn快速教程
    文件读写
  • 原文地址:https://www.cnblogs.com/njczy2010/p/5489057.html
Copyright © 2011-2022 走看看