JAVA_Range Addition II_LeetCode 598

JAVA_Range Addition II_LeetCode 598 풀이 class Solution { public int maxCount(int m, int n, int[][] ops) { if (ops.length==0) return m*n; for(int[] val : ops) { m = val[0] < m ? val[0] : m; n = val[1] < n ? val[1] : n; } return m * n; } } * 출처 Range Addition II - LeetCode Range Addition II - You are given an m x n matrix M initialized with all 0's and an array of operations ops, where ops[i] = [ai, bi] means M[x][y] should be incremented by one for all 0 <= x < ai and 0 <= y < bi. Count and return...

원문링크 : JAVA_Range Addition II_LeetCode 598