| | | 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.MaximumNumberOfEventsThatCanBeAttended; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class MaximumNumberOfEventsThatCanBeAttendedPriorityQueue : IMaximumNumberOfEventsThatCanBeAttended |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n log n) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="events"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int MaxEvents(int[][] events) |
| | 2 | 24 | | { |
| | 10 | 25 | | Array.Sort(events, (event1, event2) => event1[0] - event2[0]); |
| | | 26 | | |
| | 2 | 27 | | var maxEvents = 0; |
| | | 28 | | |
| | 2 | 29 | | var priorityQueue = new PriorityQueue<int, int>(); |
| | | 30 | | |
| | 2 | 31 | | var eventIndex = 0; |
| | | 32 | | |
| | 2 | 33 | | var day = 0; |
| | | 34 | | |
| | 11 | 35 | | while (eventIndex < events.Length || priorityQueue.Count > 0) |
| | 9 | 36 | | { |
| | 16 | 37 | | while (eventIndex < events.Length && events[eventIndex][0] <= day) |
| | 7 | 38 | | { |
| | 7 | 39 | | priorityQueue.Enqueue(events[eventIndex][1], events[eventIndex][1]); |
| | | 40 | | |
| | 7 | 41 | | eventIndex++; |
| | 7 | 42 | | } |
| | | 43 | | |
| | 9 | 44 | | while (priorityQueue.Count > 0 && priorityQueue.Peek() < day) |
| | 0 | 45 | | { |
| | 0 | 46 | | priorityQueue.Dequeue(); |
| | 0 | 47 | | } |
| | | 48 | | |
| | 9 | 49 | | if (priorityQueue.Count > 0) |
| | 7 | 50 | | { |
| | 7 | 51 | | priorityQueue.Dequeue(); |
| | | 52 | | |
| | 7 | 53 | | maxEvents++; |
| | 7 | 54 | | } |
| | | 55 | | |
| | 9 | 56 | | day++; |
| | 9 | 57 | | } |
| | | 58 | | |
| | 2 | 59 | | return maxEvents; |
| | 2 | 60 | | } |
| | | 61 | | } |