| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 Eugene Eremeev (also known as Yevhenii Yeriemeieiv). |
| | | 3 | | // All Rights Reserved. |
| | | 4 | | // -------------------------------------------------------------------------------- |
| | | 5 | | // This software is the confidential and proprietary information of Eugene Eremeev |
| | | 6 | | // (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not |
| | | 7 | | // disclose such Confidential Information and shall use it only in accordance with |
| | | 8 | | // the terms of the license agreement you entered into with Eugene Eremeev (also |
| | | 9 | | // known as Yevhenii Yeriemeieiv). |
| | | 10 | | // -------------------------------------------------------------------------------- |
| | | 11 | | |
| | | 12 | | namespace LeetCode.Algorithms.RangeAddition2; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class RangeAddition2Greedy : IRangeAddition2 |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n), where n is the length of ops |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="m"></param> |
| | | 22 | | /// <param name="n"></param> |
| | | 23 | | /// <param name="ops"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public int MaxCount(int m, int n, int[][] ops) |
| | 3 | 26 | | { |
| | 34 | 27 | | for (var i = 0; i < ops.Length; i++) |
| | 14 | 28 | | { |
| | 14 | 29 | | var op = ops[i]; |
| | | 30 | | |
| | 14 | 31 | | var a = op[0]; |
| | 14 | 32 | | var b = op[1]; |
| | | 33 | | |
| | 14 | 34 | | m = Math.Min(m, a); |
| | 14 | 35 | | n = Math.Min(n, b); |
| | 14 | 36 | | } |
| | | 37 | | |
| | 3 | 38 | | return m * n; |
| | 3 | 39 | | } |
| | | 40 | | } |