| | | 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 DivideIntervalsIntoMinimumNumberOfGroupsLineSweep : IDivideIntervalsIntoMinimumNumberOfGroups |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(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 rangeStart = int.MaxValue; |
| | 2 | 26 | | var rangeEnd = int.MinValue; |
| | | 27 | | |
| | 24 | 28 | | foreach (var interval in intervals) |
| | 9 | 29 | | { |
| | 9 | 30 | | rangeStart = Math.Min(rangeStart, interval[0]); |
| | 9 | 31 | | rangeEnd = Math.Max(rangeEnd, interval[1]); |
| | 9 | 32 | | } |
| | | 33 | | |
| | 2 | 34 | | var pointToCount = new int[rangeEnd + 2]; |
| | | 35 | | |
| | 24 | 36 | | foreach (var interval in intervals) |
| | 9 | 37 | | { |
| | 9 | 38 | | pointToCount[interval[0]]++; |
| | 9 | 39 | | pointToCount[interval[1] + 1]--; |
| | 9 | 40 | | } |
| | | 41 | | |
| | 2 | 42 | | var concurrentIntervals = 0; |
| | 2 | 43 | | var maxConcurrentIntervals = 0; |
| | | 44 | | |
| | 50 | 45 | | for (var i = rangeStart; i <= rangeEnd; i++) |
| | 23 | 46 | | { |
| | 23 | 47 | | concurrentIntervals += pointToCount[i]; |
| | | 48 | | |
| | 23 | 49 | | maxConcurrentIntervals = Math.Max(maxConcurrentIntervals, concurrentIntervals); |
| | 23 | 50 | | } |
| | | 51 | | |
| | 2 | 52 | | return maxConcurrentIntervals; |
| | 2 | 53 | | } |
| | | 54 | | } |