| | | 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.CountTheNumberOfConsistentStrings; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class CountTheNumberOfConsistentStringsArray : ICountTheNumberOfConsistentStrings |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n * m + k), where k is the length of allowed string, n is the number of words, m is the |
| | | 19 | | /// of words |
| | | 20 | | /// Space complexity - O(1) |
| | | 21 | | /// </summary> |
| | | 22 | | /// <param name="allowed"></param> |
| | | 23 | | /// <param name="words"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public int CountConsistentStrings(string allowed, string[] words) |
| | 3 | 26 | | { |
| | 3 | 27 | | var count = words.Length; |
| | | 28 | | |
| | 3 | 29 | | var allowedArray = new bool['z' - 'a' + 1]; |
| | | 30 | | |
| | 25 | 31 | | foreach (var allowedChar in allowed) |
| | 8 | 32 | | { |
| | 8 | 33 | | allowedArray[allowedChar - 'a'] = true; |
| | 8 | 34 | | } |
| | | 35 | | |
| | 49 | 36 | | foreach (var word in words) |
| | 20 | 37 | | { |
| | 58 | 38 | | if (word.Any(wordChar => !allowedArray[wordChar - 'a'])) |
| | 7 | 39 | | { |
| | 7 | 40 | | count--; |
| | 7 | 41 | | } |
| | 20 | 42 | | } |
| | | 43 | | |
| | 3 | 44 | | return count; |
| | 3 | 45 | | } |
| | | 46 | | } |