| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 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.LargestTimeForGivenDigits; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class LargestTimeForGivenDigitsBruteForce : ILargestTimeForGivenDigits |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(1) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="arr"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public string LargestTimeFromDigits(int[] arr) |
| | 2 | 24 | | { |
| | 2 | 25 | | var maxMinutes = -1; |
| | | 26 | | |
| | 20 | 27 | | for (var i = 0; i < 4; i++) |
| | 8 | 28 | | { |
| | 8 | 29 | | var h1 = arr[i]; |
| | | 30 | | |
| | 8 | 31 | | if (h1 > 2) |
| | 6 | 32 | | { |
| | 6 | 33 | | continue; |
| | | 34 | | } |
| | | 35 | | |
| | 20 | 36 | | for (var j = 0; j < 4; j++) |
| | 8 | 37 | | { |
| | 8 | 38 | | if (i == j) |
| | 2 | 39 | | { |
| | 2 | 40 | | continue; |
| | | 41 | | } |
| | | 42 | | |
| | 6 | 43 | | var h2 = arr[j]; |
| | | 44 | | |
| | 6 | 45 | | if (h1 == 2 && h2 > 3) |
| | 1 | 46 | | { |
| | 1 | 47 | | continue; |
| | | 48 | | } |
| | | 49 | | |
| | 50 | 50 | | for (var k = 0; k < 4; k++) |
| | 20 | 51 | | { |
| | 20 | 52 | | if (i == k || j == k) |
| | 10 | 53 | | { |
| | 10 | 54 | | continue; |
| | | 55 | | } |
| | | 56 | | |
| | 10 | 57 | | var m1 = arr[k]; |
| | | 58 | | |
| | 10 | 59 | | if (m1 > 5) |
| | 0 | 60 | | { |
| | 0 | 61 | | continue; |
| | | 62 | | } |
| | | 63 | | |
| | 10 | 64 | | var l = 6 - i - j - k; |
| | | 65 | | |
| | 10 | 66 | | var hours = (h1 * 10) + h2; |
| | 10 | 67 | | var minutes = (m1 * 10) + arr[l]; |
| | | 68 | | |
| | 10 | 69 | | var totalMinutes = (hours * 60) + minutes; |
| | | 70 | | |
| | 10 | 71 | | if (totalMinutes > maxMinutes) |
| | 10 | 72 | | { |
| | 10 | 73 | | maxMinutes = totalMinutes; |
| | 10 | 74 | | } |
| | 10 | 75 | | } |
| | 5 | 76 | | } |
| | 2 | 77 | | } |
| | | 78 | | |
| | 2 | 79 | | return maxMinutes < 0 ? string.Empty : BuildTimeString(maxMinutes); |
| | 2 | 80 | | } |
| | | 81 | | |
| | | 82 | | private static string BuildTimeString(int totalMinutes) |
| | 1 | 83 | | { |
| | 1 | 84 | | var hours = totalMinutes / 60; |
| | 1 | 85 | | var minutes = totalMinutes % 60; |
| | | 86 | | |
| | 1 | 87 | | var h1 = hours / 10; |
| | 1 | 88 | | var h2 = hours % 10; |
| | 1 | 89 | | var m1 = minutes / 10; |
| | 1 | 90 | | var m2 = minutes % 10; |
| | | 91 | | |
| | 1 | 92 | | return string.Create(5, (h1, h2, m1, m2), static (dest, s) => |
| | 1 | 93 | | { |
| | 1 | 94 | | dest[0] = (char)('0' + s.h1); |
| | 1 | 95 | | dest[1] = (char)('0' + s.h2); |
| | 1 | 96 | | dest[2] = ':'; |
| | 1 | 97 | | dest[3] = (char)('0' + s.m1); |
| | 1 | 98 | | dest[4] = (char)('0' + s.m2); |
| | 2 | 99 | | }); |
| | 1 | 100 | | } |
| | | 101 | | } |