[leetcode]598. Range Addition II

最新推荐文章于 2024-09-16 06:54:08 发布

你看见我的代码了么

最新推荐文章于 2024-09-16 06:54:08 发布

阅读量111

点赞数

分类专栏： LeetCode 文章标签： leetcode

本文链接：https://blog.csdn.net/weixin_32135877/article/details/81005879

版权

LeetCode 专栏收录该内容

336 篇文章 0 订阅

订阅专栏

[leetcode]598. Range Addition II

Analysis

ummm~—— [ummmm~]

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.
如果按照他题目的意思定义二维数组，然后一步步计算的话，最后提交会显示内存溢出，所以只能另辟蹊径。因为他每次都是从M[0][0] 开始加一，所以只要计算ops二维数组里最小的row和最小的column就行了。

Implement

class Solution {
public:
    int maxCount(int m, int n, vector<vector<int>>& ops) {
        int minr = m;
        int minl = n;
        int len = ops.size();
        for(int i=0; i<len; i++){
            minr = min(minr, ops[i][0]);
            minl = min(minl, ops[i][1]);
        }
        return minr*minl;
    }
};