| | | 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.WordPattern; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class WordPatternTwoDictionaries : IWordPattern |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n + m), where n is the length of s and m is the length of pattern |
| | | 19 | | /// Space complexity - O(m + k), where m is the number of unique characters in pattern and k is the number of un |
| | | 20 | | /// words in s |
| | | 21 | | /// </summary> |
| | | 22 | | /// <param name="pattern"></param> |
| | | 23 | | /// <param name="s"></param> |
| | | 24 | | /// <returns></returns> |
| | | 25 | | public bool WordPattern(string pattern, string s) |
| | 5 | 26 | | { |
| | 5 | 27 | | var patternHashSet = new Dictionary<char, string>(); |
| | 5 | 28 | | var sHashSet = new Dictionary<string, char>(); |
| | | 29 | | |
| | 5 | 30 | | var sArray = s.Split(' '); |
| | | 31 | | |
| | 5 | 32 | | if (pattern.Length != sArray.Length) |
| | 1 | 33 | | { |
| | 1 | 34 | | return false; |
| | | 35 | | } |
| | | 36 | | |
| | 26 | 37 | | for (var i = 0; i < pattern.Length; i++) |
| | 12 | 38 | | { |
| | 12 | 39 | | if (patternHashSet.TryGetValue(pattern[i], out var patternValue)) |
| | 5 | 40 | | { |
| | 5 | 41 | | if (patternValue != sArray[i]) |
| | 2 | 42 | | { |
| | 2 | 43 | | return false; |
| | | 44 | | } |
| | 3 | 45 | | } |
| | | 46 | | else |
| | 7 | 47 | | { |
| | 7 | 48 | | if (sHashSet.TryGetValue(sArray[i], out var sValue)) |
| | 1 | 49 | | { |
| | 1 | 50 | | if (sValue != pattern[i]) |
| | 1 | 51 | | { |
| | 1 | 52 | | return false; |
| | | 53 | | } |
| | 0 | 54 | | } |
| | | 55 | | |
| | 6 | 56 | | sHashSet.Add(sArray[i], pattern[i]); |
| | 6 | 57 | | patternHashSet.Add(pattern[i], sArray[i]); |
| | 6 | 58 | | } |
| | 9 | 59 | | } |
| | | 60 | | |
| | 1 | 61 | | return true; |
| | 5 | 62 | | } |
| | | 63 | | } |