| | | 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.ValidPalindrome2; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class ValidPalindrome2TwoPointers : IValidPalindrome2 |
| | | 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 bool ValidPalindrome(string s) |
| | 4 | 24 | | { |
| | 4 | 25 | | var left = 0; |
| | 4 | 26 | | var right = s.Length - 1; |
| | | 27 | | |
| | 25 | 28 | | while (left < right) |
| | 24 | 29 | | { |
| | 24 | 30 | | if (s[left] == s[right]) |
| | 21 | 31 | | { |
| | 21 | 32 | | left++; |
| | 21 | 33 | | right--; |
| | 21 | 34 | | } |
| | | 35 | | else |
| | 3 | 36 | | { |
| | 3 | 37 | | return IsSubPalindrome(s, left + 1, right) || IsSubPalindrome(s, left, right - 1); |
| | | 38 | | } |
| | 21 | 39 | | } |
| | | 40 | | |
| | 1 | 41 | | return true; |
| | 4 | 42 | | } |
| | | 43 | | |
| | | 44 | | private static bool IsSubPalindrome(string s, int left, int right) |
| | 5 | 45 | | { |
| | 37 | 46 | | while (left < right) |
| | 35 | 47 | | { |
| | 35 | 48 | | if (s[left] == s[right]) |
| | 32 | 49 | | { |
| | 32 | 50 | | left++; |
| | 32 | 51 | | right--; |
| | 32 | 52 | | } |
| | | 53 | | else |
| | 3 | 54 | | { |
| | 3 | 55 | | return false; |
| | | 56 | | } |
| | 32 | 57 | | } |
| | | 58 | | |
| | 2 | 59 | | return true; |
| | 5 | 60 | | } |
| | | 61 | | } |