solves range addition II

Author: anishLearnsToCode

README.md

@@ -156,7 +156,7 @@
 | 589 | [N-Ary Tree Preorder Traversal](https://leetcode.com/problems/n-ary-tree-preorder-traversal) | Easy | [![Java](assets/java.png)](src/NArayTreePreOrderTraversal.java) [![Python](assets/python.png)](python/n_ary_tree_preorder_traversal.py) |
 | 590 | [N-Ary Tree Postorder Traversal](https://leetcode.com/problems/n-ary-tree-postorder-traversal) | Easy | [![Java](assets/java.png)](src/NAryTreePostorderTraversal.java) [![Python](assets/python.png)](python/n_ary_tree_postorder_traversal.py) |
 | 594 | [Longest Harmonious Subsequence](https://leetcode.com/problems/longest-harmonious-subsequence) | Easy | [![Java](assets/java.png)](src/LongestHarmoniousSubsequence.java) [![Python](assets/python.png)](python/longest_harmonious_subequence.py) |
-| 598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | Easy | |
+| 598 | [Range Addition II](https://leetcode.com/problems/range-addition-ii) | Easy | [![Java](assets/java.png)](src/RangeAdditionII.java) [![Python](assets/python.png)](python/range_addition_ii.py) |
 | 599 | [Minimum Index Sum of 2 Lists](https://leetcode.com/problems/minimum-index-sum-of-two-lists) | Easy | |
 | 604 | [Design Compressed String Iterator](https://leetcode.com/problems/design-compressed-string-iterator) | Easy | |
 | 605 | [Can Place Flowers](https://leetcode.com/problems/can-place-flowers) | Easy | |

python/range_addition_ii.py

@@ -0,0 +1,9 @@
+from typing import List
+
+
+class Solution:
+    def maxCount(self, m: int, n: int, ops: List[List[int]]) -> int:
+        for operation in ops:
+            m = min(m, operation[0])
+            n = min(n, operation[0])
+        return m * n

src/RangeAdditionII.java

@@ -0,0 +1,9 @@
+public class RangeAdditionII {
+    public int maxCount(int m, int n, int[][] operations) {
+        for (int[] operation : operations) {
+            m = Math.min(m, operation[0]);
+            n = Math.min(n, operation[1]);
+        }
+        return m * n;
+    }
+}