| | | 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.GenerateTagForVideoCaption; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class GenerateTagForVideoCaptionCharArray : IGenerateTagForVideoCaption |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="caption"></param> |
| | | 22 | | /// <returns></returns> |
| | | 23 | | public string GenerateTag(string caption) |
| | 3 | 24 | | { |
| | 3 | 25 | | if (string.IsNullOrWhiteSpace(caption)) |
| | 0 | 26 | | { |
| | 0 | 27 | | return "#"; |
| | | 28 | | } |
| | | 29 | | |
| | 3 | 30 | | var chars = new char[100]; |
| | | 31 | | |
| | 3 | 32 | | chars[0] = '#'; |
| | | 33 | | |
| | 3 | 34 | | var isFirstWord = true; |
| | 3 | 35 | | var isWord = false; |
| | | 36 | | |
| | 3 | 37 | | var length = 1; |
| | | 38 | | |
| | 296 | 39 | | foreach (var @char in caption) |
| | 144 | 40 | | { |
| | 144 | 41 | | if (@char == ' ') |
| | 6 | 42 | | { |
| | 6 | 43 | | isWord = false; |
| | | 44 | | |
| | 6 | 45 | | continue; |
| | | 46 | | } |
| | | 47 | | |
| | | 48 | | char charToAppend; |
| | | 49 | | |
| | 138 | 50 | | if (isWord) |
| | 129 | 51 | | { |
| | 129 | 52 | | charToAppend = char.ToLowerInvariant(@char); |
| | 129 | 53 | | } |
| | | 54 | | else |
| | 9 | 55 | | { |
| | 9 | 56 | | isWord = true; |
| | | 57 | | |
| | 9 | 58 | | charToAppend = isFirstWord |
| | 9 | 59 | | ? char.ToLowerInvariant(@char) |
| | 9 | 60 | | : char.ToUpperInvariant(@char); |
| | | 61 | | |
| | 9 | 62 | | isFirstWord = false; |
| | 9 | 63 | | } |
| | | 64 | | |
| | 138 | 65 | | if (TryAppend(chars, ref length, charToAppend)) |
| | 1 | 66 | | { |
| | 1 | 67 | | break; |
| | | 68 | | } |
| | 137 | 69 | | } |
| | | 70 | | |
| | 3 | 71 | | return new string(chars, 0, length); |
| | 3 | 72 | | } |
| | | 73 | | |
| | | 74 | | private static bool TryAppend(char[] chars, ref int length, char @char) |
| | 138 | 75 | | { |
| | 138 | 76 | | if (length == 100) |
| | 1 | 77 | | { |
| | 1 | 78 | | return true; |
| | | 79 | | } |
| | | 80 | | |
| | 137 | 81 | | chars[length] = @char; |
| | | 82 | | |
| | 137 | 83 | | length++; |
| | | 84 | | |
| | 137 | 85 | | return false; |
| | 138 | 86 | | } |
| | | 87 | | } |