描述
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:
1 | Input: |
Note:
- The range of m and n is [1,40000].
- The range of a is [1,m], and the range of b is [1,n].
- The range of operations size won’t exceed 10,000.
分析
在最小数字组成的边界中的数字才会被每次更新,因此只要找到横坐标,纵坐标中的最小数字而已。
解决方案1(Java)
1 | class Solution { |