zoukankan      html  css  js  c++  java
  • [leetcode-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:
    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的元素 行和列索引是从0开始的。

    那么只需要找到操作次数最多的元素位置即可。而操作次数最多的元素肯定是偏向于靠近矩阵左上角的。

    int maxCount(int m, int n, vector<vector<int> >& ops) 
    {
            int minrow = 50000,mincol =50000;
        for(int i =0;i<ops.size();i++)
        {
          minrow =min(minrow,ops[i][0]);
          mincol = min(mincol,ops[i][1]);
        }
        minrow = min(minrow,m);
        mincol = min(mincol,n);
        return minrow*mincol;
    }
  • 相关阅读:
    01、启动优先和安全设置
    5、bam格式转为bigwig格式
    1、蛋白质二级结构预测方法
    12、IGV-Integrative Genomics Viewer
    docker-compose 工具安装
    docker-compose.yml 语法说明
    docker 镜像和容器的批量清理
    rancher 笔记 之 rancher应用中心
    golang 学习笔记
    docker registry 搭建
  • 原文地址:https://www.cnblogs.com/hellowooorld/p/6915320.html
Copyright © 2011-2022 走看看