| | | 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.CheckIfStringsCanBeMadeEqualWithOperations2; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class CheckIfStringsCanBeMadeEqualWithOperations2BruteForce : ICheckIfStringsCanBeMadeEqualWithOperations2 |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n^2) |
| | | 19 | | /// Space complexity - O(n) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="s1"></param> |
| | | 22 | | /// <param name="s2"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public bool CheckStrings(string s1, string s2) |
| | 20 | 25 | | { |
| | 20 | 26 | | var n = s1.Length; |
| | | 27 | | |
| | 20 | 28 | | var s1CharArray = s1.ToCharArray(); |
| | | 29 | | |
| | 212 | 30 | | for (var i = 0; i < n; i++) |
| | 93 | 31 | | { |
| | 93 | 32 | | if (s1CharArray[i] == s2[i]) |
| | 67 | 33 | | { |
| | 67 | 34 | | continue; |
| | | 35 | | } |
| | | 36 | | |
| | 26 | 37 | | var found = false; |
| | | 38 | | |
| | 58 | 39 | | for (var j = i + 2; j < n; j += 2) |
| | 22 | 40 | | { |
| | 22 | 41 | | if ((j - i) % 2 != 0) |
| | 0 | 42 | | { |
| | 0 | 43 | | continue; |
| | | 44 | | } |
| | | 45 | | |
| | 22 | 46 | | if (s1CharArray[j] != s2[i]) |
| | 3 | 47 | | { |
| | 3 | 48 | | continue; |
| | | 49 | | } |
| | | 50 | | |
| | 19 | 51 | | (s1CharArray[j], s1CharArray[i]) = (s1CharArray[i], s1CharArray[j]); |
| | | 52 | | |
| | 19 | 53 | | found = true; |
| | | 54 | | |
| | 19 | 55 | | break; |
| | | 56 | | } |
| | | 57 | | |
| | 26 | 58 | | if (found) |
| | 19 | 59 | | { |
| | 19 | 60 | | continue; |
| | | 61 | | } |
| | | 62 | | |
| | 7 | 63 | | return false; |
| | | 64 | | } |
| | | 65 | | |
| | 13 | 66 | | return true; |
| | 20 | 67 | | } |
| | | 68 | | } |