| | | 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.TaskScheduler; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class TaskSchedulerDictionary : ITaskScheduler |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="tasks"></param> |
| | | 22 | | /// <param name="n"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int LeastInterval(char[] tasks, int n) |
| | 3 | 25 | | { |
| | 3 | 26 | | var taskCounts = new Dictionary<char, int>(); |
| | | 27 | | |
| | 45 | 28 | | foreach (var task in tasks) |
| | 18 | 29 | | { |
| | 18 | 30 | | if (!taskCounts.TryAdd(task, 1)) |
| | 10 | 31 | | { |
| | 10 | 32 | | taskCounts[task]++; |
| | 10 | 33 | | } |
| | 18 | 34 | | } |
| | | 35 | | |
| | 3 | 36 | | var maxFrequency = 0; |
| | 3 | 37 | | var tasksWithMaxFrequency = 0; |
| | | 38 | | |
| | 25 | 39 | | foreach (var count in taskCounts.Values) |
| | 8 | 40 | | { |
| | 8 | 41 | | if (count > maxFrequency) |
| | 3 | 42 | | { |
| | 3 | 43 | | maxFrequency = count; |
| | 3 | 44 | | tasksWithMaxFrequency = 1; |
| | 3 | 45 | | } |
| | 5 | 46 | | else if (count == maxFrequency) |
| | 3 | 47 | | { |
| | 3 | 48 | | tasksWithMaxFrequency++; |
| | 3 | 49 | | } |
| | 8 | 50 | | } |
| | | 51 | | |
| | 3 | 52 | | var partCount = maxFrequency - 1; |
| | 3 | 53 | | var partLength = n - (tasksWithMaxFrequency - 1); |
| | 3 | 54 | | var emptySlots = partCount * partLength; |
| | 3 | 55 | | var availableTasks = tasks.Length - (maxFrequency * tasksWithMaxFrequency); |
| | 3 | 56 | | var idles = Math.Max(0, emptySlots - availableTasks); |
| | | 57 | | |
| | 3 | 58 | | return tasks.Length + idles; |
| | 3 | 59 | | } |
| | | 60 | | } |