598. Range Addition II
2017-08-08 23:30
316 查看
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:
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.
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:
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.
public class Solution { public int maxCount(int m, int n, int[][] ops) { for(int[] k : ops){ m = Math.min(m,k[0]); n = Math.min(n,k[1]); } return m*n; } }
相关文章推荐
- 598. Range Addition II
- 598. Range Addition II
- Math-598-Range Addition II
- Leetcode 598 Range Addition II
- 598. Range Addition II
- 598. Range Addition II
- 598. Range Addition II
- 598. Range Addition II
- 598. Range Addition II
- Range Addition II问题及解法
- 598. Range Addition II
- RangeAdditionII、ConstructtheRectangle、ExcelSheetColumnNumber
- 算法分析与设计——LeetCode Problem.598 Range Addition II
- [leetcode]: 598. Range Addition II
- [LeetCode] Range Addition II 范围相加之二
- 598. Range Addition II
- Range Addition II
- python--leetcode598. Range Addition II
- leetcode 598. Range Addition II 范围内的操作 + 遍历即可
- LeetCode Range Addition II