[LeetCode] 598. Range Addition II - Java

• 문제 링크

Range Addition II - LeetCode

 

• 풀이 코드

public class Solution {

    public int maxCount(int m, int n, int[][] ops) {
        for (int[] op : ops) {
            m = Math.min(m, op[0]);
            n = Math.min(n, op[1]);
        }

        return m * n;
    }

}