| | | 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.AppendCharactersToStringToMakeSubsequence; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class AppendCharactersToStringToMakeSubsequenceTwoPointers : IAppendCharactersToStringToMakeSubsequence |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n + m) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="s"></param> |
| | | 22 | | /// <param name="t"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int AppendCharacters(string s, string t) |
| | 11 | 25 | | { |
| | 11 | 26 | | var sPointer = 0; |
| | 11 | 27 | | var tPointer = 0; |
| | | 28 | | |
| | 52 | 29 | | while (sPointer < s.Length && tPointer < t.Length) |
| | 41 | 30 | | { |
| | 41 | 31 | | if (s[sPointer] == t[tPointer]) |
| | 23 | 32 | | { |
| | 23 | 33 | | tPointer++; |
| | 23 | 34 | | } |
| | | 35 | | |
| | 41 | 36 | | sPointer++; |
| | 41 | 37 | | } |
| | | 38 | | |
| | 11 | 39 | | return t.Length - tPointer; |
| | 11 | 40 | | } |
| | | 41 | | } |