| | | 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.FindMissingObservations; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class FindMissingObservationsMath : IFindMissingObservations |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(m + n) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="rolls"></param> |
| | | 22 | | /// <param name="mean"></param> |
| | | 23 | | /// <param name="n"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public int[] MissingRolls(int[] rolls, int mean, int n) |
| | 5 | 26 | | { |
| | 5 | 27 | | var missingSum = (mean * (rolls.Length + n)) - rolls.Sum(); |
| | | 28 | | |
| | 5 | 29 | | if (missingSum < n || missingSum > n * 6) |
| | 3 | 30 | | { |
| | 3 | 31 | | return []; |
| | | 32 | | } |
| | | 33 | | |
| | 2 | 34 | | var result = new int[n]; |
| | | 35 | | |
| | 2 | 36 | | var baseValue = missingSum / n; |
| | 2 | 37 | | var remainder = missingSum - (baseValue * n); |
| | | 38 | | |
| | 16 | 39 | | for (var i = 0; i < n; i++) |
| | 6 | 40 | | { |
| | 6 | 41 | | result[i] = baseValue; |
| | | 42 | | |
| | 6 | 43 | | if (remainder <= 0) |
| | 5 | 44 | | { |
| | 5 | 45 | | continue; |
| | | 46 | | } |
| | | 47 | | |
| | 1 | 48 | | result[i]++; |
| | | 49 | | |
| | 1 | 50 | | remainder--; |
| | 1 | 51 | | } |
| | | 52 | | |
| | 2 | 53 | | return result; |
| | 5 | 54 | | } |
| | | 55 | | } |