| | | 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.RescheduleMeetingsForMaximumFreeTime1; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class RescheduleMeetingsForMaximumFreeTime1Greedy : IRescheduleMeetingsForMaximumFreeTime1 |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="eventTime"></param> |
| | | 22 | | /// <param name="k"></param> |
| | | 23 | | /// <param name="startTime"></param> |
| | | 24 | | /// <param name="endTime"></param> |
| | | 25 | | /// <returns></returns> |
| | | 26 | | public int MaxFreeTime(int eventTime, int k, int[] startTime, int[] endTime) |
| | 3 | 27 | | { |
| | 3 | 28 | | var maxFreeTime = 0; |
| | | 29 | | |
| | 3 | 30 | | var n = startTime.Length; |
| | | 31 | | |
| | 3 | 32 | | var currentTime = 0; |
| | | 33 | | |
| | 26 | 34 | | for (var i = 0; i < n; i++) |
| | 10 | 35 | | { |
| | 10 | 36 | | currentTime += endTime[i] - startTime[i]; |
| | | 37 | | |
| | 10 | 38 | | var left = i <= k - 1 ? 0 : endTime[i - k]; |
| | | 39 | | |
| | 10 | 40 | | var right = i == n - 1 ? eventTime : startTime[i + 1]; |
| | | 41 | | |
| | 10 | 42 | | maxFreeTime = Math.Max(maxFreeTime, right - left - currentTime); |
| | | 43 | | |
| | 10 | 44 | | if (i >= k - 1) |
| | 9 | 45 | | { |
| | 9 | 46 | | currentTime -= endTime[i - k + 1] - startTime[i - k + 1]; |
| | 9 | 47 | | } |
| | 10 | 48 | | } |
| | | 49 | | |
| | 3 | 50 | | return maxFreeTime; |
| | 3 | 51 | | } |
| | | 52 | | } |