| | | 1 | | // -------------------------------------------------------------------------------- |
| | | 2 | | // Copyright (C) 2026 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.MinimumASCIIDeleteSumForTwoStrings; |
| | | 13 | | |
| | | 14 | | /// <inheritdoc /> |
| | | 15 | | public sealed class MinimumASCIIDeleteSumForTwoStringsDynamicProgramming : IMinimumASCIIDeleteSumForTwoStrings |
| | | 16 | | { |
| | | 17 | | /// <summary> |
| | | 18 | | /// Time complexity - O(n * m) |
| | | 19 | | /// Space complexity - O(min(n, m)) |
| | | 20 | | /// </summary> |
| | | 21 | | /// <param name="s1"></param> |
| | | 22 | | /// <param name="s2"></param> |
| | | 23 | | /// <returns></returns> |
| | | 24 | | public int MinimumDeleteSum(string s1, string s2) |
| | 2 | 25 | | { |
| | 2 | 26 | | if (s1.Length < s2.Length) |
| | 0 | 27 | | { |
| | 0 | 28 | | (s1, s2) = (s2, s1); |
| | 0 | 29 | | } |
| | | 30 | | |
| | 2 | 31 | | Span<int> dp = stackalloc int[s2.Length + 1]; |
| | | 32 | | |
| | 22 | 33 | | for (var i = 0; i < s1.Length; i++) |
| | 9 | 34 | | { |
| | 9 | 35 | | var previous = 0; |
| | | 36 | | |
| | 84 | 37 | | for (var j = 0; j < s2.Length; j++) |
| | 33 | 38 | | { |
| | 33 | 39 | | var current = dp[j + 1]; |
| | | 40 | | |
| | 33 | 41 | | if (s1[i] == s2[j]) |
| | 10 | 42 | | { |
| | 10 | 43 | | dp[j + 1] = previous + s1[i]; |
| | 10 | 44 | | } |
| | 23 | 45 | | else if (dp[j + 1] <= dp[j]) |
| | 17 | 46 | | { |
| | 17 | 47 | | dp[j + 1] = dp[j]; |
| | 17 | 48 | | } |
| | | 49 | | |
| | 33 | 50 | | previous = current; |
| | 33 | 51 | | } |
| | 9 | 52 | | } |
| | | 53 | | |
| | 2 | 54 | | var totalAscii = 0; |
| | | 55 | | |
| | 24 | 56 | | foreach (var c in s1) |
| | 9 | 57 | | { |
| | 9 | 58 | | totalAscii += c; |
| | 9 | 59 | | } |
| | | 60 | | |
| | 20 | 61 | | foreach (var c in s2) |
| | 7 | 62 | | { |
| | 7 | 63 | | totalAscii += c; |
| | 7 | 64 | | } |
| | | 65 | | |
| | 2 | 66 | | return totalAscii - (2 * dp[^1]); |
| | 2 | 67 | | } |
| | | 68 | | } |