| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2025 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.DivideIntervalsIntoMinimumNumberOfGroups; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class DivideIntervalsIntoMinimumNumberOfGroupsSorting : IDivideIntervalsIntoMinimumNumberOfGroups |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n log n) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="intervals"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int MinGroups(int[][] intervals) |
| | 2 | 24 | | { |
| | 2 | 25 | | var events = new List<(int Time, int Type)>(); |
| | | 26 | | |
| | 24 | 27 | | foreach (var interval in intervals) |
| | 9 | 28 | | { |
| | 9 | 29 | | events.Add((interval[0], 1)); |
| | 9 | 30 | | events.Add((interval[1], -1)); |
| | 9 | 31 | | } |
| | | 32 | | |
| | 43 | 33 | | events.Sort((a, b) => a.Time == b.Time ? b.Type.CompareTo(a.Type) : a.Time.CompareTo(b.Time)); |
| | | 34 | | |
| | 2 | 35 | | var minGroups = 0; |
| | 2 | 36 | | var activeIntervals = 0; |
| | | 37 | | |
| | 40 | 38 | | for (var i = 0; i < events.Count; i++) |
| | 18 | 39 | | { |
| | 18 | 40 | | activeIntervals += events[i].Type; |
| | | 41 | | |
| | 18 | 42 | | minGroups = Math.Max(minGroups, activeIntervals); |
| | 18 | 43 | | } |
| | | 44 | | |
| | 2 | 45 | | return minGroups; |
| | 2 | 46 | | } |
| | | 47 | | } |