| | | 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.MaximumNumberOfWordsYouCanType; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class MaximumNumberOfWordsYouCanTypeLookup : IMaximumNumberOfWordsYouCanType |
| | | 16 | | { |
| | | 17 | | private const byte AlphabetLength = 'z' - 'a' + 1; |
| | | 18 | | |
| | | 19 | | /// <summary> |
| | | 20 | | /// Time complexity - O(n + m), where n is the length of the text and m is the length of brokenLetters |
| | | 21 | | /// Space complexity - O(1) |
| | | 22 | | /// </summary> |
| | | 23 | | /// <param name="text"></param> |
| | | 24 | | /// <param name="brokenLetters"></param> |
| | | 25 | | /// <returns></returns> |
| | | 26 | | public int CanBeTypedWords(string text, string brokenLetters) |
| | 3 | 27 | | { |
| | 3 | 28 | | Span<bool> brokenLettersLookup = stackalloc bool[AlphabetLength]; |
| | | 29 | | |
| | 3 | 30 | | var brokenLettersLength = brokenLetters.Length; |
| | | 31 | | |
| | 16 | 32 | | for (var i = 0; i < brokenLettersLength; i++) |
| | 5 | 33 | | { |
| | 5 | 34 | | var brokenLetterIndex = brokenLetters[i] - 'a'; |
| | | 35 | | |
| | 5 | 36 | | brokenLettersLookup[brokenLetterIndex] = true; |
| | 5 | 37 | | } |
| | | 38 | | |
| | 3 | 39 | | var goodWordsCount = 0; |
| | | 40 | | |
| | 3 | 41 | | var isBroken = false; |
| | | 42 | | |
| | 3 | 43 | | var textLength = text.Length; |
| | | 44 | | |
| | 64 | 45 | | for (var i = 0; i < textLength; i++) |
| | 29 | 46 | | { |
| | 29 | 47 | | var c = text[i]; |
| | | 48 | | |
| | 29 | 49 | | if (c == ' ') |
| | 3 | 50 | | { |
| | 3 | 51 | | if (isBroken) |
| | 2 | 52 | | { |
| | 2 | 53 | | isBroken = false; |
| | 2 | 54 | | } |
| | | 55 | | else |
| | 1 | 56 | | { |
| | 1 | 57 | | goodWordsCount++; |
| | 1 | 58 | | } |
| | 3 | 59 | | } |
| | | 60 | | else |
| | 26 | 61 | | { |
| | 26 | 62 | | var brokenLetterIndex = c - 'a'; |
| | | 63 | | |
| | 26 | 64 | | if (!brokenLettersLookup[brokenLetterIndex]) |
| | 20 | 65 | | { |
| | 20 | 66 | | continue; |
| | | 67 | | } |
| | | 68 | | |
| | 6 | 69 | | isBroken = true; |
| | 6 | 70 | | } |
| | 9 | 71 | | } |
| | | 72 | | |
| | 3 | 73 | | if (!isBroken) |
| | 1 | 74 | | { |
| | 1 | 75 | | goodWordsCount++; |
| | 1 | 76 | | } |
| | | 77 | | |
| | 3 | 78 | | return goodWordsCount; |
| | 3 | 79 | | } |
| | | 80 | | } |