| | | 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.LongestIdealSubsequence; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public class LongestIdealSubsequenceDynamicProgramming : ILongestIdealSubsequence |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n) |
| | | 19 | | /// Space complexity - O(1) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="s"></param> |
| | | 22 | | /// <param name="k"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int LongestIdealString(string s, int k) |
| | 2 | 25 | | { |
| | 2 | 26 | | var dp = new int[26]; |
| | 2 | 27 | | var maxLength = 0; |
| | | 28 | | |
| | 26 | 29 | | foreach (var ch in s) |
| | 10 | 30 | | { |
| | 10 | 31 | | var currentMaxLength = 1; |
| | | 32 | | |
| | 118 | 33 | | for (var i = Math.Max('a', ch - k); i <= Math.Min('z', ch + k); i++) |
| | 49 | 34 | | { |
| | 49 | 35 | | var idx = i - 'a'; |
| | | 36 | | |
| | 49 | 37 | | currentMaxLength = Math.Max(currentMaxLength, dp[idx] + 1); |
| | 49 | 38 | | } |
| | | 39 | | |
| | 10 | 40 | | dp[ch - 'a'] = currentMaxLength; |
| | | 41 | | |
| | 10 | 42 | | maxLength = Math.Max(maxLength, currentMaxLength); |
| | 10 | 43 | | } |
| | | 44 | | |
| | 2 | 45 | | return maxLength; |
| | 2 | 46 | | } |
| | | 47 | | } |