| | | 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.CheckIfTwoStringArraysAreEquivalent; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class CheckIfTwoStringArraysAreEquivalentTwoPointers : ICheckIfTwoStringArraysAreEquivalent |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n + m) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="word1"></param> |
| | | 22 | | /// <param name="word2"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public bool ArrayStringsAreEqual(string[] word1, string[] word2) |
| | 7 | 25 | | { |
| | 7 | 26 | | var wordIndex1 = 0; |
| | 7 | 27 | | var wordIndex2 = 0; |
| | 7 | 28 | | var charIndex1 = 0; |
| | 7 | 29 | | var charIndex2 = 0; |
| | | 30 | | |
| | 45 | 31 | | while (wordIndex1 < word1.Length && wordIndex2 < word2.Length) |
| | 41 | 32 | | { |
| | 41 | 33 | | if (word1[wordIndex1][charIndex1] != word2[wordIndex2][charIndex2]) |
| | 3 | 34 | | { |
| | 3 | 35 | | return false; |
| | | 36 | | } |
| | | 37 | | |
| | 38 | 38 | | charIndex1++; |
| | 38 | 39 | | charIndex2++; |
| | | 40 | | |
| | 38 | 41 | | if (charIndex1 == word1[wordIndex1].Length) |
| | 12 | 42 | | { |
| | 12 | 43 | | wordIndex1++; |
| | 12 | 44 | | charIndex1 = 0; |
| | 12 | 45 | | } |
| | | 46 | | |
| | 38 | 47 | | if (charIndex2 != word2[wordIndex2].Length) |
| | 28 | 48 | | { |
| | 28 | 49 | | continue; |
| | | 50 | | } |
| | | 51 | | |
| | 10 | 52 | | wordIndex2++; |
| | 10 | 53 | | charIndex2 = 0; |
| | 10 | 54 | | } |
| | | 55 | | |
| | 4 | 56 | | return wordIndex1 == word1.Length && wordIndex2 == word2.Length; |
| | 7 | 57 | | } |
| | | 58 | | } |