598. Range Addition II
来源:互联网 发布:欧陆天使淘宝店 编辑:程序博客网 时间:2024/06/09 20:35
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 = 3operations = [[2,2],[3,3]]Output: 4Explanation: 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; } }
阅读全文
0 0
- 598. Range Addition II
- 598. Range Addition II
- 598. Range Addition II
- 598. Range Addition II
- 598. Range Addition II
- 598. Range Addition II
- 598. Range Addition II
- 598. Range Addition II
- 598. Range Addition II
- 598. Range Addition II
- 598. Range Addition II
- [leetcode]598. Range Addition II
- [leetcode]: 598. Range Addition II
- leetcode 598. Range Addition II
- [LeetCode]598. Range Addition II
- LeetCode 598. Range Addition II
- leetcode-598. Range Addition II
- leetcode 598. Range Addition II
- 手工构建Android应用
- python 解析JSON
- 归并排序,树状数组,求逆序数 (openjudge 7662)
- 2017.08.08工作日记
- 改进Fibonacci数列
- 598. Range Addition II
- Mac中安装tar包的Mysql服务
- 大数据面试总结
- java实现HMACSHA256(md5私钥key)加密签名
- KVO底层实现原理
- Windows版mysql启动之后设置密码,Navicat无法连接mysql问题
- Java8的流Stream与收集器Collector详解
- 进程和线程小结
- dts分析