From af532ce8d8665cd741285dd9bbc7204e5430e216 Mon Sep 17 00:00:00 2001 From: yanglbme Date: Wed, 11 Jun 2025 17:35:44 +0800 Subject: [PATCH] feat: add solutions to lc problem: No.3579 No.3579.Minimum Steps to Convert String with Operations --- .../README.md | 191 +++++++++++++++++- .../README_EN.md | 191 +++++++++++++++++- .../Solution.cpp | 42 ++++ .../Solution.go | 44 ++++ .../Solution.java | 36 ++++ .../Solution.py | 24 +++ .../Solution.ts | 38 ++++ 7 files changed, 560 insertions(+), 6 deletions(-) create mode 100644 solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.cpp create mode 100644 solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.go create mode 100644 solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.java create mode 100644 solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.py create mode 100644 solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.ts diff --git a/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/README.md b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/README.md index cd166837484a8..a5717cc4a6e3b 100644 --- a/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/README.md +++ b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/README.md @@ -151,25 +151,210 @@ tags: #### Python3 ```python - +class Solution: + def minOperations(self, word1: str, word2: str) -> int: + def calc(l: int, r: int, rev: bool) -> int: + cnt = Counter() + res = 0 + for i in range(l, r + 1): + j = r - (i - l) if rev else i + a, b = word1[j], word2[i] + if a != b: + if cnt[(b, a)] > 0: + cnt[(b, a)] -= 1 + else: + cnt[(a, b)] += 1 + res += 1 + return res + + n = len(word1) + f = [inf] * (n + 1) + f[0] = 0 + for i in range(1, n + 1): + for j in range(i): + t = min(calc(j, i - 1, False), 1 + calc(j, i - 1, True)) + f[i] = min(f[i], f[j] + t) + return f[n] ``` #### Java ```java - +class Solution { + public int minOperations(String word1, String word2) { + int n = word1.length(); + int[] f = new int[n + 1]; + Arrays.fill(f, Integer.MAX_VALUE); + f[0] = 0; + for (int i = 1; i <= n; i++) { + for (int j = 0; j < i; j++) { + int a = calc(word1, word2, j, i - 1, false); + int b = 1 + calc(word1, word2, j, i - 1, true); + int t = Math.min(a, b); + f[i] = Math.min(f[i], f[j] + t); + } + } + return f[n]; + } + + private int calc(String word1, String word2, int l, int r, boolean rev) { + int[][] cnt = new int[26][26]; + int res = 0; + for (int i = l; i <= r; i++) { + int j = rev ? r - (i - l) : i; + int a = word1.charAt(j) - 'a'; + int b = word2.charAt(i) - 'a'; + if (a != b) { + if (cnt[b][a] > 0) { + cnt[b][a]--; + } else { + cnt[a][b]++; + res++; + } + } + } + return res; + } +} ``` #### C++ ```cpp - +class Solution { +public: + int minOperations(string word1, string word2) { + int n = word1.length(); + vector f(n + 1, INT_MAX); + f[0] = 0; + + for (int i = 1; i <= n; ++i) { + for (int j = 0; j < i; ++j) { + int a = calc(word1, word2, j, i - 1, false); + int b = 1 + calc(word1, word2, j, i - 1, true); + int t = min(a, b); + f[i] = min(f[i], f[j] + t); + } + } + + return f[n]; + } + +private: + int calc(const string& word1, const string& word2, int l, int r, bool rev) { + int cnt[26][26] = {0}; + int res = 0; + + for (int i = l; i <= r; ++i) { + int j = rev ? r - (i - l) : i; + int a = word1[j] - 'a'; + int b = word2[i] - 'a'; + + if (a != b) { + if (cnt[b][a] > 0) { + cnt[b][a]--; + } else { + cnt[a][b]++; + res++; + } + } + } + + return res; + } +}; ``` #### Go ```go +func minOperations(word1 string, word2 string) int { + n := len(word1) + f := make([]int, n+1) + for i := range f { + f[i] = math.MaxInt32 + } + f[0] = 0 + + calc := func(l, r int, rev bool) int { + var cnt [26][26]int + res := 0 + + for i := l; i <= r; i++ { + j := i + if rev { + j = r - (i - l) + } + a := word1[j] - 'a' + b := word2[i] - 'a' + + if a != b { + if cnt[b][a] > 0 { + cnt[b][a]-- + } else { + cnt[a][b]++ + res++ + } + } + } + + return res + } + + for i := 1; i <= n; i++ { + for j := 0; j < i; j++ { + a := calc(j, i-1, false) + b := 1 + calc(j, i-1, true) + t := min(a, b) + f[i] = min(f[i], f[j]+t) + } + } + + return f[n] +} +``` +#### TypeScript + +```ts +function minOperations(word1: string, word2: string): number { + const n = word1.length; + const f = Array(n + 1).fill(Number.MAX_SAFE_INTEGER); + f[0] = 0; + + function calc(l: number, r: number, rev: boolean): number { + const cnt: number[][] = Array.from({ length: 26 }, () => Array(26).fill(0)); + let res = 0; + + for (let i = l; i <= r; i++) { + const j = rev ? r - (i - l) : i; + const a = word1.charCodeAt(j) - 97; + const b = word2.charCodeAt(i) - 97; + + if (a !== b) { + if (cnt[b][a] > 0) { + cnt[b][a]--; + } else { + cnt[a][b]++; + res++; + } + } + } + + return res; + } + + for (let i = 1; i <= n; i++) { + for (let j = 0; j < i; j++) { + const a = calc(j, i - 1, false); + const b = 1 + calc(j, i - 1, true); + const t = Math.min(a, b); + f[i] = Math.min(f[i], f[j] + t); + } + } + + return f[n]; +} ``` diff --git a/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/README_EN.md b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/README_EN.md index 95d8bde8a6c39..3a479ed5ab9a9 100644 --- a/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/README_EN.md +++ b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/README_EN.md @@ -146,25 +146,210 @@ tags: #### Python3 ```python - +class Solution: + def minOperations(self, word1: str, word2: str) -> int: + def calc(l: int, r: int, rev: bool) -> int: + cnt = Counter() + res = 0 + for i in range(l, r + 1): + j = r - (i - l) if rev else i + a, b = word1[j], word2[i] + if a != b: + if cnt[(b, a)] > 0: + cnt[(b, a)] -= 1 + else: + cnt[(a, b)] += 1 + res += 1 + return res + + n = len(word1) + f = [inf] * (n + 1) + f[0] = 0 + for i in range(1, n + 1): + for j in range(i): + t = min(calc(j, i - 1, False), 1 + calc(j, i - 1, True)) + f[i] = min(f[i], f[j] + t) + return f[n] ``` #### Java ```java - +class Solution { + public int minOperations(String word1, String word2) { + int n = word1.length(); + int[] f = new int[n + 1]; + Arrays.fill(f, Integer.MAX_VALUE); + f[0] = 0; + for (int i = 1; i <= n; i++) { + for (int j = 0; j < i; j++) { + int a = calc(word1, word2, j, i - 1, false); + int b = 1 + calc(word1, word2, j, i - 1, true); + int t = Math.min(a, b); + f[i] = Math.min(f[i], f[j] + t); + } + } + return f[n]; + } + + private int calc(String word1, String word2, int l, int r, boolean rev) { + int[][] cnt = new int[26][26]; + int res = 0; + for (int i = l; i <= r; i++) { + int j = rev ? r - (i - l) : i; + int a = word1.charAt(j) - 'a'; + int b = word2.charAt(i) - 'a'; + if (a != b) { + if (cnt[b][a] > 0) { + cnt[b][a]--; + } else { + cnt[a][b]++; + res++; + } + } + } + return res; + } +} ``` #### C++ ```cpp - +class Solution { +public: + int minOperations(string word1, string word2) { + int n = word1.length(); + vector f(n + 1, INT_MAX); + f[0] = 0; + + for (int i = 1; i <= n; ++i) { + for (int j = 0; j < i; ++j) { + int a = calc(word1, word2, j, i - 1, false); + int b = 1 + calc(word1, word2, j, i - 1, true); + int t = min(a, b); + f[i] = min(f[i], f[j] + t); + } + } + + return f[n]; + } + +private: + int calc(const string& word1, const string& word2, int l, int r, bool rev) { + int cnt[26][26] = {0}; + int res = 0; + + for (int i = l; i <= r; ++i) { + int j = rev ? r - (i - l) : i; + int a = word1[j] - 'a'; + int b = word2[i] - 'a'; + + if (a != b) { + if (cnt[b][a] > 0) { + cnt[b][a]--; + } else { + cnt[a][b]++; + res++; + } + } + } + + return res; + } +}; ``` #### Go ```go +func minOperations(word1 string, word2 string) int { + n := len(word1) + f := make([]int, n+1) + for i := range f { + f[i] = math.MaxInt32 + } + f[0] = 0 + + calc := func(l, r int, rev bool) int { + var cnt [26][26]int + res := 0 + + for i := l; i <= r; i++ { + j := i + if rev { + j = r - (i - l) + } + a := word1[j] - 'a' + b := word2[i] - 'a' + + if a != b { + if cnt[b][a] > 0 { + cnt[b][a]-- + } else { + cnt[a][b]++ + res++ + } + } + } + + return res + } + + for i := 1; i <= n; i++ { + for j := 0; j < i; j++ { + a := calc(j, i-1, false) + b := 1 + calc(j, i-1, true) + t := min(a, b) + f[i] = min(f[i], f[j]+t) + } + } + + return f[n] +} +``` +#### TypeScript + +```ts +function minOperations(word1: string, word2: string): number { + const n = word1.length; + const f = Array(n + 1).fill(Number.MAX_SAFE_INTEGER); + f[0] = 0; + + function calc(l: number, r: number, rev: boolean): number { + const cnt: number[][] = Array.from({ length: 26 }, () => Array(26).fill(0)); + let res = 0; + + for (let i = l; i <= r; i++) { + const j = rev ? r - (i - l) : i; + const a = word1.charCodeAt(j) - 97; + const b = word2.charCodeAt(i) - 97; + + if (a !== b) { + if (cnt[b][a] > 0) { + cnt[b][a]--; + } else { + cnt[a][b]++; + res++; + } + } + } + + return res; + } + + for (let i = 1; i <= n; i++) { + for (let j = 0; j < i; j++) { + const a = calc(j, i - 1, false); + const b = 1 + calc(j, i - 1, true); + const t = Math.min(a, b); + f[i] = Math.min(f[i], f[j] + t); + } + } + + return f[n]; +} ``` diff --git a/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.cpp b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.cpp new file mode 100644 index 0000000000000..961f86871699a --- /dev/null +++ b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.cpp @@ -0,0 +1,42 @@ +class Solution { +public: + int minOperations(string word1, string word2) { + int n = word1.length(); + vector f(n + 1, INT_MAX); + f[0] = 0; + + for (int i = 1; i <= n; ++i) { + for (int j = 0; j < i; ++j) { + int a = calc(word1, word2, j, i - 1, false); + int b = 1 + calc(word1, word2, j, i - 1, true); + int t = min(a, b); + f[i] = min(f[i], f[j] + t); + } + } + + return f[n]; + } + +private: + int calc(const string& word1, const string& word2, int l, int r, bool rev) { + int cnt[26][26] = {0}; + int res = 0; + + for (int i = l; i <= r; ++i) { + int j = rev ? r - (i - l) : i; + int a = word1[j] - 'a'; + int b = word2[i] - 'a'; + + if (a != b) { + if (cnt[b][a] > 0) { + cnt[b][a]--; + } else { + cnt[a][b]++; + res++; + } + } + } + + return res; + } +}; diff --git a/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.go b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.go new file mode 100644 index 0000000000000..fdeb9ff8ebbb2 --- /dev/null +++ b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.go @@ -0,0 +1,44 @@ +func minOperations(word1 string, word2 string) int { + n := len(word1) + f := make([]int, n+1) + for i := range f { + f[i] = math.MaxInt32 + } + f[0] = 0 + + calc := func(l, r int, rev bool) int { + var cnt [26][26]int + res := 0 + + for i := l; i <= r; i++ { + j := i + if rev { + j = r - (i - l) + } + a := word1[j] - 'a' + b := word2[i] - 'a' + + if a != b { + if cnt[b][a] > 0 { + cnt[b][a]-- + } else { + cnt[a][b]++ + res++ + } + } + } + + return res + } + + for i := 1; i <= n; i++ { + for j := 0; j < i; j++ { + a := calc(j, i-1, false) + b := 1 + calc(j, i-1, true) + t := min(a, b) + f[i] = min(f[i], f[j]+t) + } + } + + return f[n] +} \ No newline at end of file diff --git a/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.java b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.java new file mode 100644 index 0000000000000..92552f1666fad --- /dev/null +++ b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.java @@ -0,0 +1,36 @@ +class Solution { + public int minOperations(String word1, String word2) { + int n = word1.length(); + int[] f = new int[n + 1]; + Arrays.fill(f, Integer.MAX_VALUE); + f[0] = 0; + for (int i = 1; i <= n; i++) { + for (int j = 0; j < i; j++) { + int a = calc(word1, word2, j, i - 1, false); + int b = 1 + calc(word1, word2, j, i - 1, true); + int t = Math.min(a, b); + f[i] = Math.min(f[i], f[j] + t); + } + } + return f[n]; + } + + private int calc(String word1, String word2, int l, int r, boolean rev) { + int[][] cnt = new int[26][26]; + int res = 0; + for (int i = l; i <= r; i++) { + int j = rev ? r - (i - l) : i; + int a = word1.charAt(j) - 'a'; + int b = word2.charAt(i) - 'a'; + if (a != b) { + if (cnt[b][a] > 0) { + cnt[b][a]--; + } else { + cnt[a][b]++; + res++; + } + } + } + return res; + } +} diff --git a/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.py b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.py new file mode 100644 index 0000000000000..c6dc24cb43fb5 --- /dev/null +++ b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.py @@ -0,0 +1,24 @@ +class Solution: + def minOperations(self, word1: str, word2: str) -> int: + def calc(l: int, r: int, rev: bool) -> int: + cnt = Counter() + res = 0 + for i in range(l, r + 1): + j = r - (i - l) if rev else i + a, b = word1[j], word2[i] + if a != b: + if cnt[(b, a)] > 0: + cnt[(b, a)] -= 1 + else: + cnt[(a, b)] += 1 + res += 1 + return res + + n = len(word1) + f = [inf] * (n + 1) + f[0] = 0 + for i in range(1, n + 1): + for j in range(i): + t = min(calc(j, i - 1, False), 1 + calc(j, i - 1, True)) + f[i] = min(f[i], f[j] + t) + return f[n] diff --git a/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.ts b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.ts new file mode 100644 index 0000000000000..d722e248a65f8 --- /dev/null +++ b/solution/3500-3599/3579.Minimum Steps to Convert String with Operations/Solution.ts @@ -0,0 +1,38 @@ +function minOperations(word1: string, word2: string): number { + const n = word1.length; + const f = Array(n + 1).fill(Number.MAX_SAFE_INTEGER); + f[0] = 0; + + function calc(l: number, r: number, rev: boolean): number { + const cnt: number[][] = Array.from({ length: 26 }, () => Array(26).fill(0)); + let res = 0; + + for (let i = l; i <= r; i++) { + const j = rev ? r - (i - l) : i; + const a = word1.charCodeAt(j) - 97; + const b = word2.charCodeAt(i) - 97; + + if (a !== b) { + if (cnt[b][a] > 0) { + cnt[b][a]--; + } else { + cnt[a][b]++; + res++; + } + } + } + + return res; + } + + for (let i = 1; i <= n; i++) { + for (let j = 0; j < i; j++) { + const a = calc(j, i - 1, false); + const b = 1 + calc(j, i - 1, true); + const t = Math.min(a, b); + f[i] = Math.min(f[i], f[j] + t); + } + } + + return f[n]; +}