| | 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.MinimumLengthOfStringAfterDeletingSimilarEnds; |
| | 13 | |
|
| | 14 | | /// <inheritdoc /> |
| | 15 | | public class MinimumLengthOfStringAfterDeletingSimilarEndsTwoPointers : IMinimumLengthOfStringAfterDeletingSimilarEnds |
| | 16 | | { |
| | 17 | | /// <summary> |
| | 18 | | /// Time complexity - O(n) |
| | 19 | | /// Space complexity - O(1) |
| | 20 | | /// </summary> |
| | 21 | | /// <param name="s"></param> |
| | 22 | | /// <returns></returns> |
| | 23 | | public int MinimumLength(string s) |
| 5 | 24 | | { |
| 5 | 25 | | var left = 0; |
| 5 | 26 | | var right = s.Length - 1; |
| | 27 | |
|
| 14 | 28 | | while (left < right && s[left] == s[right]) |
| 9 | 29 | | { |
| 9 | 30 | | var currentChar = s[left]; |
| | 31 | |
|
| 69 | 32 | | while (left <= right && s[left] == currentChar) |
| 60 | 33 | | { |
| 60 | 34 | | left++; |
| 60 | 35 | | } |
| | 36 | |
|
| 34 | 37 | | while (left <= right && s[right] == currentChar) |
| 25 | 38 | | { |
| 25 | 39 | | right--; |
| 25 | 40 | | } |
| 9 | 41 | | } |
| | 42 | |
|
| 5 | 43 | | return Math.Max(right - left + 1, 0); |
| 5 | 44 | | } |
| | 45 | | } |