Add solution #598

Author: JoshCrozier

README.md

@@ -462,6 +462,7 @@
 592|[Fraction Addition and Subtraction](./0592-fraction-addition-and-subtraction.js)|Medium|
 593|[Valid Square](./0593-valid-square.js)|Medium|
 594|[Longest Harmonious Subsequence](./0594-longest-harmonious-subsequence.js)|Easy|
+598|[Range Addition II](./0598-range-addition-ii.js)|Easy|
 599|[Minimum Index Sum of Two Lists](./0599-minimum-index-sum-of-two-lists.js)|Easy|
 605|[Can Place Flowers](./0605-can-place-flowers.js)|Easy|
 606|[Construct String from Binary Tree](./0606-construct-string-from-binary-tree.js)|Easy|

solutions/0598-range-addition-ii.js

@@ -0,0 +1,30 @@
+/**
+ * 598. Range Addition II
+ * https://leetcode.com/problems/range-addition-ii/
+ * Difficulty: Easy
+ *
+ * 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 the number of maximum integers in the matrix after performing all the
+ * operations.
+ */
+
+/**
+ * @param {number} m
+ * @param {number} n
+ * @param {number[][]} ops
+ * @return {number}
+ */
+var maxCount = function(m, n, ops) {
+  let a = m;
+  let b = n;
+
+  for (const op of ops) {
+    a = Math.min(a, op[0]);
+    b = Math.min(b, op[1]);
+  }
+
+  return a * b;
+};