[LC] 0598 Range Addition II

Java

/**
 * <a href="https://leetcode.cn/problems/range-addition-ii/">Range Addition II</a>
 * 数组；数学
 */
class Solution {
    public int maxCount(int m, int n, int[][] ops) {
        int mina = m, minb = n;
        for (int[] op : ops) {
            mina = Math.min(mina, op[0]);
            minb = Math.min(minb, op[1]);
        }
        return mina * minb;
    }
}

Go

func maxCount(m int, n int, ops [][]int) int {
    mina, minb := m, n
    for _, op := range ops {
        mina = min(mina, op[0])
        minb = min(minb, op[1])
    }
    return mina * minb
}

JavaScript

/**
 * @param {number} m
 * @param {number} n
 * @param {number[][]} ops
 * @return {number}
 */
var maxCount = function(m, n, ops) {
    let mina = m, minb = n;
    for (let op of ops) {
        mina = Math.min(mina, op[0]);
        minb = Math.min(minb, op[1]);
    }
    return mina * minb;
};

PHP

class Solution {

    /**
     * @param Integer $m
     * @param Integer $n
     * @param Integer[][] $ops
     * @return Integer
     */
    function maxCount(int $m, int $n, array $ops): int {
        $mina = $m;
        $minb = $n;
        foreach ($ops as $op) {
            $mina = min($mina, $op[0]);
            $minb = min($minb, $op[1]);
        }
        return $mina * $minb;
    }
}