zoukankan      html  css  js  c++  java
  • 598. Range Addition II

    Given an m * n matrix M initialized with all 0's and several update operations.

    Operations are represented by a 2D array, and each operation is represented by an array with two positive integers a and b, which means M[i][j] should be added by one for all 0 <= i < a and 0 <= j < b.

    You need to count and return the number of maximum integers in the matrix after performing all the operations.

    Example 1:

    Input: 
    m = 3, n = 3
    operations = [[2,2],[3,3]]
    Output: 4
    Explanation: 
    Initially, M = 
    [[0, 0, 0],
     [0, 0, 0],
     [0, 0, 0]]
    
    After performing [2,2], M = 
    [[1, 1, 0],
     [1, 1, 0],
     [0, 0, 0]]
    
    After performing [3,3], M = 
    [[2, 2, 1],
     [2, 2, 1],
     [1, 1, 1]]
    
    So the maximum integer in M is 2, and there are four of it in M. So return 4.
    

    Note:

    1. The range of m and n is [1,40000].
    2. The range of a is [1,m], and the range of b is [1,n].
    3. The range of operations size won't exceed 10,000.

    C++(6ms):

     1 class Solution {
     2 public:
     3     int maxCount(int m, int n, vector<vector<int>>& ops) {
     4         for (auto op : ops){
     5             m = min(m,op[0]) ;
     6             n = min(n,op[1]) ;
     7         }
     8         return m*n ;
     9     }
    10 };

    java(6ms):

    1 class Solution {
    2     public int maxCount(int m, int n, int[][] ops) {
    3         for (int[] op : ops){
    4             m = Math.min(m,op[0]) ;
    5             n = Math.min(n,op[1]) ;
    6         }
    7         return m*n ;
    8     }
    9 }
  • 相关阅读:
    字符串题目
    Java 练习题摘录
    数据库原理及应用-引言
    数学类题目
    牛顿法
    动态规划-最大子段和
    判断数幂
    杭电1096
    算法导论01 几种排序以及其时间复杂度01
    杭电2059龟兔赛跑
  • 原文地址:https://www.cnblogs.com/mengchunchen/p/7824965.html
Copyright © 2011-2022 走看看