| | | 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.UniqueThreeDigitEvenNumbers; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class UniqueThreeDigitEvenNumbersDigitsFrequency : IUniqueThreeDigitEvenNumbers |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="digits"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int TotalNumbers(int[] digits) |
| | 4 | 24 | | { |
| | 4 | 25 | | var digitsFrequency = new int[10]; |
| | | 26 | | |
| | 38 | 27 | | foreach (var digit in digits) |
| | 13 | 28 | | { |
| | 13 | 29 | | digitsFrequency[digit]++; |
| | 13 | 30 | | } |
| | | 31 | | |
| | 4 | 32 | | var count = 0; |
| | | 33 | | |
| | 80 | 34 | | for (var i = 1; i <= 9; i++) |
| | 36 | 35 | | { |
| | 36 | 36 | | if (digitsFrequency[i] == 0) |
| | 27 | 37 | | { |
| | 27 | 38 | | continue; |
| | | 39 | | } |
| | | 40 | | |
| | 198 | 41 | | for (var j = 0; j <= 9; j++) |
| | 90 | 42 | | { |
| | 90 | 43 | | if (digitsFrequency[j] == 0) |
| | 62 | 44 | | { |
| | 62 | 45 | | continue; |
| | | 46 | | } |
| | | 47 | | |
| | 336 | 48 | | for (var k = 0; k <= 9; k += 2) |
| | 140 | 49 | | { |
| | 140 | 50 | | if (digitsFrequency[k] == 0) |
| | 103 | 51 | | { |
| | 103 | 52 | | continue; |
| | | 53 | | } |
| | | 54 | | |
| | 37 | 55 | | if (i == j && j == k) |
| | 4 | 56 | | { |
| | 4 | 57 | | if (digitsFrequency[i] < 3) |
| | 3 | 58 | | { |
| | 3 | 59 | | continue; |
| | | 60 | | } |
| | 1 | 61 | | } |
| | 33 | 62 | | else if (i == j) |
| | 7 | 63 | | { |
| | 7 | 64 | | if (digitsFrequency[i] < 2 || digitsFrequency[k] < 1) |
| | 6 | 65 | | { |
| | 6 | 66 | | continue; |
| | | 67 | | } |
| | 1 | 68 | | } |
| | 26 | 69 | | else if (i == k) |
| | 7 | 70 | | { |
| | 7 | 71 | | if (digitsFrequency[i] < 2 || digitsFrequency[j] < 1) |
| | 6 | 72 | | { |
| | 6 | 73 | | continue; |
| | | 74 | | } |
| | 1 | 75 | | } |
| | 19 | 76 | | else if (j == k) |
| | 7 | 77 | | { |
| | 7 | 78 | | if (digitsFrequency[j] < 2 || digitsFrequency[i] < 1) |
| | 7 | 79 | | { |
| | 7 | 80 | | continue; |
| | | 81 | | } |
| | 0 | 82 | | } |
| | | 83 | | else |
| | 12 | 84 | | { |
| | 12 | 85 | | if (digitsFrequency[i] < 1 || digitsFrequency[j] < 1 || digitsFrequency[k] < 1) |
| | 0 | 86 | | { |
| | 0 | 87 | | continue; |
| | | 88 | | } |
| | 12 | 89 | | } |
| | | 90 | | |
| | 15 | 91 | | count++; |
| | 15 | 92 | | } |
| | 28 | 93 | | } |
| | 9 | 94 | | } |
| | | 95 | | |
| | 4 | 96 | | return count; |
| | 4 | 97 | | } |
| | | 98 | | } |