| | | 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.FindingThreeDigitEvenNumbers; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class FindingThreeDigitEvenNumbersFrequency : IFindingThreeDigitEvenNumbers |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(1) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="digits"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public int[] FindEvenNumbers(int[] digits) |
| | 3 | 24 | | { |
| | 3 | 25 | | var digitsFrequency = new int[10]; |
| | | 26 | | |
| | 33 | 27 | | foreach (var digit in digits) |
| | 12 | 28 | | { |
| | 12 | 29 | | digitsFrequency[digit]++; |
| | 12 | 30 | | } |
| | | 31 | | |
| | 3 | 32 | | var result = new List<int>(); |
| | | 33 | | |
| | 60 | 34 | | for (var i = 1; i < 10; i++) |
| | 27 | 35 | | { |
| | 27 | 36 | | if (digitsFrequency[i] <= 0) |
| | 19 | 37 | | { |
| | 19 | 38 | | continue; |
| | | 39 | | } |
| | | 40 | | |
| | 8 | 41 | | digitsFrequency[i]--; |
| | | 42 | | |
| | 176 | 43 | | for (var j = 0; j < 10; j++) |
| | 80 | 44 | | { |
| | 80 | 45 | | if (digitsFrequency[j] <= 0) |
| | 61 | 46 | | { |
| | 61 | 47 | | continue; |
| | | 48 | | } |
| | | 49 | | |
| | 19 | 50 | | digitsFrequency[j]--; |
| | | 51 | | |
| | 228 | 52 | | for (var k = 0; k < 10; k += 2) |
| | 95 | 53 | | { |
| | 95 | 54 | | if (digitsFrequency[k] > 0) |
| | 17 | 55 | | { |
| | 17 | 56 | | result.Add((i * 100) + (j * 10) + k); |
| | 17 | 57 | | } |
| | 95 | 58 | | } |
| | | 59 | | |
| | 19 | 60 | | digitsFrequency[j]++; |
| | 19 | 61 | | } |
| | | 62 | | |
| | 8 | 63 | | digitsFrequency[i]++; |
| | 8 | 64 | | } |
| | | 65 | | |
| | 3 | 66 | | return result.ToArray(); |
| | 3 | 67 | | } |
| | | 68 | | } |